Planar point location using persistent search trees
Communications of the ACM
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Output-size sensitive algorithms for constructive problems in computational geometry
Output-size sensitive algorithms for constructive problems in computational geometry
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A randomized algorithm for closest-point queries
SIAM Journal on Computing
Representing geometric structures in d dimensions: topology and order
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry
Degenerate convex hulls in high dimensions without extra storage
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
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
How good are convex hull algorithms?
Computational Geometry: Theory and Applications
Face numbers of polytopes and complexes
Handbook of discrete and computational geometry
Algorithmic geometry
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Convex Polytopes
Journal of the ACM (JACM)
| Hi-index | 0.00 |