Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:algorithmic_problem |
finding a convex partition with the minimum number of parts
|
| gptkbp:appliesTo |
polyhedra
polygons |
| gptkbp:complexity |
NP-hard for general polygons with holes
polynomial time for simple polygons |
| gptkbp:defines |
a division of a geometric object into convex pieces
|
| gptkbp:field |
gptkb:geometry
|
| https://www.w3.org/2000/01/rdf-schema#label |
convex partition
|
| gptkbp:minimum_number_of_parts |
depends on the shape of the object
|
| gptkbp:property |
each part is convex
parts are non-overlapping union of parts equals the original object |
| gptkbp:relatedTo |
gptkb:art_gallery_problem
polygon triangulation BSP tree convex decomposition |
| gptkbp:usedIn |
computer graphics
robot motion planning mesh generation |
| gptkbp:bfsParent |
gptkb:Convex_geometry
|
| gptkbp:bfsLayer |
7
|