AI helps you reading Science
Partitioning a planar assembly into two connected parts is NP-complete
Inf. Process. Lett., no. 3 (1995): 159-165
EI
Keywords
Abstract
Consider the following decision problem. Given a collection of non-overlapping (but possibly touching) polygons in the plane, is there a properconnected subcollection of it that can be separated from its complementmoving as a rigid body, without disturbing the other parts of the collection,and such that the complement is also connected? ...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn