Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons

DOI10.1145/1998196.1998263zbMath1283.68334OpenAlexW2156457461MaRDI QIDQ5404455

Mohammad Ali Abam, Amirali Khosravi, Boris Aronov, Mark T. de Berg

Publication date: 24 March 2014

Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/approximation-algorithms-for-computing-partitions-with-minimum-stabbing-number-of-rectilinear-and-simple-polygons(801e681a-3e08-484b-ab7c-c6e6f5bd885c).html

zbMATH Keywords

computational geometryapproximation algorithmspolygonsstabbing numberrectangular decompositionsSteiner triangulations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

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

This page was built for publication: Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons