Partitioning a polygonal region into trapezoids
- 1 April 1986
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 33 (2) , 290-312
- https://doi.org/10.1145/5383.5387
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- The power of non-rectilinear holesPublished by Springer Nature ,1982
- Electron-beam exposure system AMDESComputer-Aided Design, 1979
- Intersection graphs of curves in the planeJournal of Combinatorial Theory, Series B, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969