Linear-time heuristics for minimum weight rectangulation

DOI10.1007/3-540-61422-2_138MaRDI QIDQ5054819zbMATH OpenOpenAlexFDO

Authors Anna Östlin, Christos Levcopoulos

Publication date 9 December 2022

Published in Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61422-2_138

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• On heuristics for minimum length rectilinear partitions
• scientific article; zbMATH DE number 3883609
• Computing partitions of rectilinear polygons with minimum stabbing number
• scientific article; zbMATH DE number 4062592
• scientific article; zbMATH DE number 4049401

Cites work

• A unifying look at data structures
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding the medial axis of a simple polygon in linear time
• scientific article; zbMATH DE number 3883609 (Why is no real title available?)
• scientific article; zbMATH DE number 3784283 (Why is no real title available?)
• Linear-time heuristics for minimum weight rectangulation

Cited in

(7)

• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• Lower bounds for approximate polygon decomposition and minimum gap
• Rectangular partitions of a rectilinear polygon
• 3D rectangulations and geometric matrix multiplication
• Linear-time heuristics for minimum weight rectangulation
• A Geometric Heuristic for Rectilinear Crossing Minimization
• On heuristics for minimum length rectilinear partitions

This page was built for publication: Linear-time heuristics for minimum weight rectangulation

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