scientific article; zbMATH DE number 3883609

MaRDI QIDQ3217601zbMATH OpenFDO

Authors Christos Levcopoulos, Andrzej Lingas

Publication date 1984

zbMATH Keywords

convex partitions of polygonsheuristic algorithmspartitioning rectilinear polygons into rectangles

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Minimum k-partitioning of rectilinear polygons
• On heuristics for minimum length rectilinear partitions
• scientific article; zbMATH DE number 4062592
• Algorithms for minimum length partitions of polygons
• scientific article; zbMATH DE number 4049401

Cited in

(18)

• Algorithms for minimum length partitions of polygons
• Improved bounds for rectangular and guillotine partitions
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Approximate convex decomposition of polygons
• Rectangular partitions of a rectilinear polygon
• On \(d\)-convex partitions of polygonal regions
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Asymptotics of Perimeter-Minimizing Partitions
• scientific article; zbMATH DE number 4062592 (Why is no real title available?)
• scientific article; zbMATH DE number 1159075 (Why is no real title available?)
• Constant-factor approximation for TSP with disks
• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• Linear-time heuristics for minimum weight rectangulation
• Minimum weight convex Steiner partitions
• On heuristics for minimum length rectilinear partitions
• Computational Science and Its Applications – ICCSA 2004
• Observation routes and external watchman routes
• Observation routes and external watchman routes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217601)