Topologically sweeping visibility complexes via pseudotriangulations
- 1 April 1996
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 16 (4) , 419-453
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Minimal tangent visibility graphsComputational Geometry, 1996
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- A fast algorithm for computing sparse visibility graphsAlgorithmica, 1990
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Time and space efficient algorithms for shortest paths between convex polygonsInformation Processing Letters, 1988
- Visibility of disjoint polygonsAlgorithmica, 1986
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979