scientific article; zbMATH DE number 3883609

MaRDI QIDQ3217601zbMATH OpenFDO

Authors Christos Levcopoulos, Andrzej Lingas

Publication date 1984

zbMATH Keywords

heuristic algorithmsconvex partitions of polygonspartitioning rectilinear polygons into rectangles

Mathematics Subject Classification ID

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

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

(16)

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

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)