Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Three-dimensional triangulations from local transformations
SIAM Journal on Scientific and Statistical Computing
An optimal convex hull algorithm and new results on cuttings (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Degenerate convex hulls in high dimensions without extra storage
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Incremental topological flipping works for regular triangulations
SCG '92 Proceedings of the eighth annual symposium on 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
Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
Computer Aided Geometric Design
Proceedings of the twelfth annual symposium on Computational geometry
Regular triangulations of dynamic sets of points
Computer Aided Geometric Design
Constrained paths in the flip-graph of regular triangulations
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |