Approximation algorithms for partitioning a rectangle with interior points
- 1 June 1990
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 5 (1-4) , 11-42
- https://doi.org/10.1007/bf01840375
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast heuristics for minimum length rectangular partitions of polygonsPublished by Association for Computing Machinery (ACM) ,1986
- Bounds for partitioning rectilinear polygonsPublished by Association for Computing Machinery (ACM) ,1985
- The "PI" (Placement And Interconnect) SystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An efficient algorithm for decomposing a polygon into star-shaped polygonsPattern Recognition, 1981
- Decomposing a polygon into its convex partsPublished by Association for Computing Machinery (ACM) ,1979
- On two-dimensional data organization I1Fundamenta Informaticae, 1979
- Triangulating a simple polygonInformation Processing Letters, 1978