Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number
From MaRDI portal
Publication:2914327
DOI10.1007/978-3-642-32241-9_20zbMath1364.68345OpenAlexW176842924MaRDI QIDQ2914327
Saeed Mehrabi, Stephane Durocher
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_20
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (3)
Partitions of rectilinear polygons with minimum stabbing number ⋮ Minimum stabbing rectangular partitions of rectilinear polygons ⋮ Computing conforming partitions of orthogonal polygons with minimum stabbing number
This page was built for publication: Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number