Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles

DOI10.1007/BF02189307zbMath0757.68096MaRDI QIDQ1196367

Alexei Gorpinevich, Valeriu Soltan

Publication date: 14 December 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131234

zbMATH Keywords

holesrectanglesrectilinear polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete geometry (52C99)

Related Items

Approximation algorithms for decomposing octilinear polygons ⋮ A hybrid heuristic for the rectilinear picture compression problem ⋮ CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES ⋮ Optimal matrix-segmentation by rectangles ⋮ MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN ⋮ EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX ⋮ On convex partitions of polygonal regions ⋮ Extracting compact fuzzy rules based on adaptive data approximation using B-splines ⋮ Lower bounds for approximate polygon decomposition and minimum gap

Cites Work

• Finding a manhattan path and related problems
• Efficient Algorithms for Geometric Graph Search Problems
• Minimal rectangular partitions of digitized blobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item