Partitioning a planar assembly into two connected parts is NP-complete (Q672026)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning a planar assembly into two connected parts is NP-complete |
scientific article; zbMATH DE number 984731
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a planar assembly into two connected parts is NP-complete |
scientific article; zbMATH DE number 984731 |
Statements
Partitioning a planar assembly into two connected parts is NP-complete (English)
0 references
27 February 1997
0 references
Computational complexity
0 references
Computational geometry
0 references
Assembly planning
0 references
Motion planning
0 references
0 references
