Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Polygon triangulation: efficiency and minimality
Journal of Algorithms
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Erratum: an O (n log log n)-time algorithm for triangulating a simple polygon
SIAM Journal on Computing
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
A geometric consistency theorem for a symbolic perturbation scheme
Journal of Computer and System Sciences
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
A fast Las Vegas algorithm for triangulating a simple polygon
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Polygon triangulation in O(n log log n) time with simple data-structures
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A fast planar partition algorithm, I
Journal of Symbolic Computation
Symbolic treatment of geometric degeneracies
Journal of Symbolic Computation
Computational Geometry: Theory and Applications
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Planar separators and parallel polygon triangulation
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Derandomization in computational geometry
Journal of Algorithms
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
ACM SIGACT News
Splitting a Delaunay Triangulation in Linear Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Triangulating and guarding realistic polygons
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |