Home /Research /An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components
OTHER

An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components

Sukhamay Kundu, Sridhar Radhakrishnan

Year
1990
Citations
2

Keywords

Separable spacePolygon (computer graphics)MathematicsAlgorithmCombinatoricsPlane (geometry)Set (abstract data type)Closure (psychology)Star-shaped polygonRegular polygon

Related papers

Browse all OTHER papers