Approximation algorithms for partitioning a rectangle with interior points

DOI10.1007/BF01840375zbMath0688.68035OpenAlexW2032846908MaRDI QIDQ1263970

Si-Qing Zheng, Teofilo F. Gonzalez

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840375

zbMATH Keywords

approximation algorithmspolynomial time complexitypartition of rectilinear polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx)

Related Items

On optimal guillotine partitions approximating optimal \(d\)-box partitions ⋮ Computing conforming partitions of orthogonal polygons with minimum stabbing number ⋮ Rectangular partitions of a rectilinear polygon ⋮ On the number of rectangulations of a planar point set ⋮ EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING

Cites Work

• Triangulating a simple polygon
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item