Primal-dual methods for vertex and facet enumeration (preliminary version)

Authors:
David Bremner;Komei Fukuda;Ambros Marzetta
Affiliations:
School of Computer Science, McGill University, Montréal, Canada;Department of Mathematics, Swiss Federal Institute of Technology, Lausanne and Institute for Operations Research, Swiss Federal Institute of Technology, Zurich, Switzerland;Institute for Theoretical Computer Science, Swiss Federal Institute of Technology, Zurich, Switzerland
Venue:
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Year:
1997

Citing 6
Cited 3

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Output-size sensitive algorithms for constructive problems in computational geometry

Output-size sensitive algorithms for constructive problems in computational geometry
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Linear programming

Linear programming
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron

Computational Geometry: Theory and Applications
An Algorithm for Convex Polytopes

Journal of the ACM (JACM)

Output-sensitive cell enumeration in hyperplane arrangements

Nordic Journal of Computing
Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems

Computers and Operations Research
Multi-target and Multi-camera Object Detection with Monte-Carlo Sampling

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract