Solving visibility problems by using skeleton structures
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 459-470
- https://doi.org/10.1007/bfb0030329
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On translating a set of line segmentsComputer Vision, Graphics, and Image Processing, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Comments on “algorithms for reporting and counting geometric intersections”IEEE Transactions on Computers, 1981
- Trees as data and file structuresPublished by Springer Nature ,1981
- Finding the contour of a union of iso-oriented rectangiesJournal of Algorithms, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- On translating a set of rectanglesPublished by Association for Computing Machinery (ACM) ,1980
- A Note on Locating a Set of Points in a Planar SubdivisionSIAM Journal on Computing, 1979
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Location of a Point in a Planar Subdivision and Its ApplicationsSIAM Journal on Computing, 1977