Partitions of rectilinear polygons with minimum stabbing number

DOI10.1016/J.ENDM.2015.07.045zbMATH Open1356.90088OpenAlexW2214723548MaRDI QIDQ324809FDOQ324809

Breno Piva, Cid Carvalho de Souza

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.045

zbMATH Keywords

integer programmingmin stabbing numberrectangular partition

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Cites Work

• Minimizing the stabbing number of matchings, trees, and triangulations
• Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number
• EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING

Cited In (9)

• Algorithms and Data Structures
• Minimum Perimeter-Sum Partitions in the Plane
• On partitions with \(k\) corners not containing the staircase with one more corner
• Computational Science and Its Applications – ICCSA 2004
• Title not available (Why is that?)
• Rectilinear decompositions with low stabbing number
• Minimum k-partitioning of rectilinear polygons
• Minimum stabbing rectangular partitions of rectilinear polygons
• On partitioning rectilinear polygons into star-shaped polygons

This page was built for publication: Partitions of rectilinear polygons with minimum stabbing number

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