Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles

DOI10.1007/BF02189307zbMATH Open0757.68096MaRDI QIDQ1196367FDOQ1196367

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4049401
• Minimum k-partitioning of rectilinear polygons
• Linear-time heuristics for minimum weight rectangulation
• Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
• Minimum convex partition of a polygon with holes by cuts in given directions

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)

Cites Work

• Efficient Algorithms for Geometric Graph Search Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding a manhattan path and related problems
• Minimal rectangular partitions of digitized blobs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Extracting compact fuzzy rules based on adaptive data approximation using B-splines
• Approximation algorithms for decomposing octilinear polygons
• A hybrid heuristic for the rectilinear picture compression problem
• MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN
• Lower bounds for approximate polygon decomposition and minimum gap
• Minimum convex partition of a polygon with holes by cuts in given directions
• On convex partitions of polygonal regions
• Optimal matrix-segmentation by rectangles
• Dissection with the fewest pieces is hard, even to approximate
• Cartesian product partitioning of multi-dimensional reachable state spaces
• Effect of corner information in simultaneous placement of \(k\) rectangles and tableaux
• Minimum stabbing rectangular partitions of rectilinear polygons

This page was built for publication: Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles

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