首页 /研究 /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

发表年份
1990
引用次数
2

关键词

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

相关论文

查看 OTHER 分类全部论文