Computational geometry: an introduction
Computational geometry: an introduction
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Implicitly representing arrangements of lines or segments
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Single-layer wire routing and compaction
Single-layer wire routing and compaction
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Counting and reporting red/blue segment intersections
CVGIP: Graphical Models and Image Processing
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Transforming curves on surfaces
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computing homotopic shortest paths in the plane
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Computing Homotopic Shortest Paths Efficiently
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Computing homotopic shortest paths in the plane
Journal of Algorithms
Computational Geometry: Theory and Applications
Computing homotopic shortest paths efficiently
Computational Geometry: Theory and Applications
Thick non-crossing paths and minimum-cost flows in polygonal domains
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Computing homotopic shortest paths efficiently
Computational Geometry: Theory and Applications
Simplifying massive contour maps
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
In this paper we present an efficient algorithm to test if two given paths are homotopic; that is, whether they wind around obstacles in the plane in the same way. For simple paths specified by n line segments with obstacles described by n points, our algorithm runs in O(n log n) time, which we show is tight. For self-intersecting paths the problem is related to Hopcroft's problem.