Sorting Jordan sequences in linear time using level-linked search trees
Information and Control
Enumerative combinatorics
Topologically sweeping an arrangement
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Topologically sweeping the visibility complex of polygonal scenes
Proceedings of the eleventh annual symposium on Computational geometry
Pseudo-triangulations: theory and applications
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computational geometry column 43
ACM SIGACT News
On local transformation of polygons with visibility properties
Theoretical Computer Science
On Local Transformation of Polygons with Visibility Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Kinetic collision detection between two simple polygons
Computational Geometry: Theory and Applications
Computing the visibility graph of points within a polygon
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry: Theory and Applications
Transforming Triangulations on Nonplanar Surfaces
SIAM Journal on Discrete Mathematics
The stochastic walk algorithms for point location in pseudo-triangulations
Advances in Engineering Software
Construction of pseudo-triangulation by incremental insertion
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Computing shortest paths amid pseudodisks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Shortest path in a multiply-connected domain having curved boundaries
Computer-Aided Design
Minimum area enclosure and alpha hull of a set of freeform planar closed curves
Computer-Aided Design
Computing shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |