A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
Discrete & computational geometry, Tome 8 (1992) no. 1, pp. 295-314
Cet article a éte moissonné depuis la source European Digital Mathematics Library
Keywords:
enumeration problems in computational geometry, pivot-based algorithm
@article{DCG_1992__8_1_131222,
author = {S. Suri and C. Monma},
title = {A {Pivoting} {Algorithm} for {Convex} {Hulls} and {Vertex} {Enumeration} of {Arrangements} and {Polyhedra.}},
journal = {Discrete & computational geometry},
pages = {295--314},
year = {1992},
volume = {8},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DCG_1992__8_1_131222/}
}
TY - JOUR AU - S. Suri AU - C. Monma TI - A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. JO - Discrete & computational geometry PY - 1992 SP - 295 EP - 314 VL - 8 IS - 1 UR - http://geodesic.mathdoc.fr/item/DCG_1992__8_1_131222/ LA - en ID - DCG_1992__8_1_131222 ER -
S. Suri; C. Monma. A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.. Discrete & computational geometry, Tome 8 (1992) no. 1, pp. 295-314. http://geodesic.mathdoc.fr/item/DCG_1992__8_1_131222/