Rectilinear decompositions with low stabbing number
From MaRDI portal
Publication:1341685
Recommendations
- Computing partitions of rectilinear 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
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Minimum stabbing rectangular partitions of rectilinear polygons
Cites work
Cited in
(9)- Algorithms and Data Structures
- Euclidean Steiner spanners: light and sparse
- Rectangulating rectilinear polygons in parallel
- Rectangularization of digital objects and its relation with straight skeletons
- Computing a maxian point of a simple rectilinear polygon
- Minimizing the stabbing number of matchings, trees, and triangulations
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Convex subdivisions with low stabbing numbers
- Minimum stabbing rectangular partitions of rectilinear polygons
This page was built for publication: Rectilinear decompositions with low stabbing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341685)