Publication:3948588
From MaRDI portal
zbMath0487.68033MaRDI QIDQ3948588
Publication date: 1982
computational geometry; NP-hard problems; geometric complexity; rectilinear polygons; polygonal holes; multiconnected polygons
68Q25: Analysis of algorithms and problem complexity
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
05B40: Combinatorial aspects of packing and covering
Related Items
Convex Partitions with 2-Edge Connected Dual Graphs, Minimum weight convex Steiner partitions, Convex partitions with 2-edge connected dual graphs, Decomposing the boundary of a nonconvex polyhedron, On the minimality of polygon triangulation, A decision procedure for optimal polyhedron partitioning, Rectangular partition is polynomial in two dimensions but NP-complete in three, Minimum k-partitioning of rectilinear polygons, Triangulating a nonconvex polytope, Some theoretical challenges in digital geometry: a perspective, A fixed parameter algorithm for optimal convex partitions, Digitization scheme that assures faithful reconstruction of plane figures, Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles, On convex partitions of polygonal regions, Erased arrangements of linear and convex decompositions of polyhedra, Algorithms for the decomposition of a polygon into convex polygons, Approximate convex decomposition of polygons
