An efficient algorithm for finding the CSG representation of a simple polygon
- 1 July 1993
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 10 (1), 1-23
- https://doi.org/10.1007/bf01908629
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Polygon properties calculated from the vertex neighborhoodsPublished by Association for Computing Machinery (ACM) ,1987
- Computational GeometryPublished by Springer Nature ,1985
- Sorting Jordan sequences in linear timePublished by Association for Computing Machinery (ACM) ,1985
- Finding the convex hull of a simple polygonJournal of Algorithms, 1983
- A kinetic framework for computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- On finding the convex hull of a simple polygonInternational Journal of Parallel Programming, 1983
- GMSolid: Interactive Modeling for Design and Analysis of SolidsIEEE Computer Graphics and Applications, 1982
- PADL-2: A Technical SummaryIEEE Computer Graphics and Applications, 1982
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979