Partitions of rectilinear polygons with minimum stabbing number
From MaRDI portal
Publication:324809
Recommendations
- Minimum stabbing rectangular partitions of rectilinear polygons
- Computing partitions of rectilinear polygons with minimum stabbing number
- Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- On rectilinear partitions with minimum stabbing number
Cites work
Cited in
(14)- 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
- Rectilinear decompositions with low stabbing number
- scientific article; zbMATH DE number 495506 (Why is no real title available?)
- On rectilinear partitions with minimum stabbing number
- Minimum \(k\)-adjacent rectangles of orthogonal polygons and its application
- Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Minimum k-partitioning of rectilinear polygons
- On partitioning rectilinear polygons into star-shaped polygons
- Computing partitions of rectilinear polygons with minimum stabbing number
- Minimum stabbing rectangular partitions of rectilinear 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)