Minimum stabbing rectangular partitions of rectilinear polygons

DOI10.1016/j.cor.2016.12.014zbMath1391.90532OpenAlexW2561526193MaRDI QIDQ1652208

Breno Piva, Cid Carvalho De Souza

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.014

zbMATH Keywords

integer programmingrectangular partitionstabbing numberrectilinear polygons

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Partitions of rectilinear polygons with minimum stabbing number
• Minimizing the stabbing number of matchings, trees, and triangulations
• On the dimension of projected polyhedra
• Rectilinear decompositions with low stabbing number
• Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number
• EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
• Optimal rectangular partitions
• Algorithms and Data Structures
• Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons

This page was built for publication: Minimum stabbing rectangular partitions of rectilinear polygons