A SOLUTION OF POLYGON CONTAINMENT, SPATIAL PLANNING, AND OTHER RELATED PROBLEMS USING MINKOWSKI OPERATIONS

被引：28

作者：

GHOSH, PK

机构：

来源：

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING | 1990年 / 49卷 / 01期

关键词：

D O I：

10.1016/0734-189X(90)90160-W

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Polygon containment and the related problems can be directly mapped to Minkowski decomposition and addition problems. Geometric problems, which can be reformulated in terms of set operations in which set theoretic tools are used to reduce the computational complexity of the problem. A decomposition boundary tracing technique is devised. -after Author

引用

页码：1 / 35

页数：35