A linear-time algorithm for triangulating simple polygons
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Jordan sorting via convex hulls of certain non-simple polygons
SCG '87 Proceedings of the third annual symposium on Computational geometry
A fast Las Vegas algorithm for triangulating a simple polygon
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Polygon triangulation in O(n log log n) time with simple data-structures
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Decision trees for geometric models
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
On degeneracy in geometric computations
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The soft heap: an approximate priority queue with optimal error rate
Journal of the ACM (JACM)
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Solving the String Statistics Problem in Time O(n log n)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Topological Peeling and Implementation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Experimental Study and Comparison of Topological Peeling and Topological Walk
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Car-Pooling as a Data Structuring Device: The Soft Heap
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Translating a convex polyhedron over monotone polyhedra
Computational Geometry: Theory and Applications
Optimal finger search trees in the pointer machine
Journal of Computer and System Sciences - STOC 2002
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
Three problems about simple polygons
Computational Geometry: Theory and Applications
Graph Drawing
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
Three problems about simple polygons
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
Efficient on-line algorithms for Euler diagram region computation
Computational Geometry: Theory and Applications
Algorithms and theory of computation handbook
Meander, folding, and arch statistics
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |