ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- 1 June 2002
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Geometry & Applications
- Vol. 12 (03) , 181-192
- https://doi.org/10.1142/s0218195902000803
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Ray shooting in polygons using geodesic triangulationsAlgorithmica, 1994
- Visibility and intersection problems in plane geometryDiscrete & Computational Geometry, 1989
- Decomposing a Polygon into Simpler ComponentsSIAM Journal on Computing, 1985
- Fast triangulation of the plane with respect to simple polygonsInformation and Control, 1985
- A linear algorithm for computing the visibility polygon from a pointJournal of Algorithms, 1981