Stabbing Convex Polygons with a Segment or a Polygon

DOI10.1007/978-3-540-87744-8_5zbMath1158.68520OpenAlexW1559302464MaRDI QIDQ3541074

Kai Tang, Shashidhara K. Ganjugunte, Ewa Misiołek, Danny Z. Chen, Pankaj K. Agarwal, Micha Sharir

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_5

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Stabbing Convex Polygons with a Segment or a Polygon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexities of efficient solutions of rectilinear polygon cover problems
• Improved approximation algorithms for geometric set cover
• On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
• On the complexity of locating linear facilities in the plane
• A threshold of ln n for approximating set cover
• On the Complexity of Some Common Geometric Location Problems
• Stabbing Convex Polygons with a Segment or a Polygon
• Approximation schemes for covering and packing problems in image processing and VLSI

This page was built for publication: Stabbing Convex Polygons with a Segment or a Polygon