Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments

DOI10.1007/978-3-319-08404-6_31zbMath1416.68197OpenAlexW71261456MaRDI QIDQ3188909

N. S. Narayanaswamy, Anup Joshi

Publication date: 2 September 2014

Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08404-6_31

zbMATH Keywords

approximation algorithmart gallery problemline segmentshitting sets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (1)

Geometric hitting set for segments of few orientations

This page was built for publication: Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments