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

DOI10.1145/1998196.1998263zbMATH Open1283.68334OpenAlexW2156457461MaRDI QIDQ5404455FDOQ5404455

Mohammad A. Abam, Boris Aronov, Amirali Khosravi, Mark 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)

Cited In (10)

• Computing optimal diameter-bounded polygon partitions
• Rectangularization of digital objects and its relation with straight skeletons
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
• Title not available (Why is that?)
• Computing conforming partitions of orthogonal polygons with minimum stabbing number
• Minimum k-partitioning of rectilinear polygons
• Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
• Stability of the 8-tetrahedra shortest-interior-edge partitioning method
• Minimum stabbing rectangular partitions of rectilinear polygons
• Approximation algorithms for partitioning a rectangle with interior points

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404455)