On some union and intersection problems for polygons with fixed orientations
- 1 September 1986
- journal article
- Published by Springer Nature in Computing
- Vol. 36 (3) , 183-197
- https://doi.org/10.1007/bf02240065
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Solving visibility problems by using skeleton structuresPublished by Springer Nature ,2006
- Computational Geometry—A SurveyIEEE Transactions on Computers, 1984
- Computing the connected components of simple rectilinear geometrical objects in $d$-spaceRAIRO. Informatique théorique, 1984
- ProblemsJournal of Algorithms, 1983
- Stabbing c-oriented polygonsInformation Processing Letters, 1983
- Fast triangulation of simple polygonsPublished by Springer Nature ,1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Rectilinear line segment intersection, layered segment trees, and dynamizationJournal of Algorithms, 1982
- The measure problem for rectangular ranges in d-spaceJournal of Algorithms, 1981
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980