Computing partitions of rectilinear polygons with minimum stabbing number
From MaRDI portal
Recommendations
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
- Partitions of rectilinear polygons with minimum stabbing number
- On rectilinear partitions with minimum stabbing number
- Minimum stabbing rectangular partitions of rectilinear polygons
Cited in
(12)- Rectilinear decompositions with low stabbing number
- Minimum stabbing rectangular partitions of rectilinear polygons
- Computing optimal diameter-bounded polygon partitions
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Partitions of rectilinear polygons with minimum stabbing number
- scientific article; zbMATH DE number 4049401 (Why is no real title available?)
- scientific article; zbMATH DE number 842885 (Why is no real title available?)
- Linear-time heuristics for minimum weight rectangulation
- On rectilinear partitions with minimum stabbing number
- Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
- On partitioning rectilinear polygons into star-shaped polygons
- Minimum k-partitioning of rectilinear polygons
This page was built for publication: Computing 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 Q2914327)