Rectilinear decompositions with low stabbing number

DOI10.1016/0020-0190(94)90129-5zbMath0823.68037OpenAlexW1994072278MaRDI QIDQ1341685

Mark T. de Berg, Marc J. 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

zbMATH Keywords

combinatorial problemscomputational geometry

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items

Euclidean Steiner Spanners: Light and Sparse ⋮ Computing a maxian point of a simple rectilinear polygon ⋮ Minimum stabbing rectangular partitions of rectilinear polygons ⋮ Computing conforming partitions of orthogonal polygons with minimum stabbing number ⋮ Rectangularization of digital objects and its relation with straight skeletons ⋮ Rectangulating rectilinear polygons in parallel ⋮ Minimizing the stabbing number of matchings, trees, and triangulations ⋮ Convex subdivisions with low stabbing numbers

Cites Work

• Implicitly representing arrangements of lines or segments
• Quasi-optimal range searching in spaces of finite VC-dimension
• Unnamed Item
• Unnamed Item