Rectilinear decompositions with low stabbing number
DOI10.1016/0020-0190(94)90129-5zbMATH Open0823.68037OpenAlexW1994072278MaRDI QIDQ1341685FDOQ1341685
Authors: Mark de Berg, Marc Van Kreveld 
Publication date: 9 January 1995
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16686
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
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
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)
