An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components
- 1 January 1990
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 23 (7) , 735-743
- https://doi.org/10.1016/0031-3203(90)90095-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On Some Distance Problems in Fixed OrientationsSIAM Journal on Computing, 1987
- Efficient Algorithms for Geometric Graph Search ProblemsSIAM Journal on Computing, 1986
- On the definition and computation of rectilinear convex hullsInformation Sciences, 1984
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the planeJournal of Algorithms, 1983
- On the X-Y convex hull of a set of X-Y polygonsBIT Numerical Mathematics, 1983
- Finding a manhattan path and related problemsNetworks, 1983