New results on stabbing segments with a polygon
DOI10.1016/j.comgeo.2014.06.002zbMath1310.52001OpenAlexW2194504615MaRDI QIDQ474818
Rodrigo I. Silveira, Matias Korman, Alexander Pilz, Carlos Seara, Pablo Pérez-Lantero, José-Miguel Díaz-Báñez
Publication date: 24 November 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.06.002
transversalsegmentsimprecise pointsminimum polygonal transversalstabberstabbing polygon problem (SPP)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (6)
Cites Work
- Convex transversals
- Computing optimal islands
- Largest and smallest convex hulls for imprecise points
- Approximating largest convex hulls for imprecise points
- The Hausdorff Voronoi diagram of point clusters in the plane
- On intersecting a set of parallel line segments with a convex polygon of minimum area
- Minimum-perimeter intersecting polygons
- Bichromatic 2-Center of Pairs of Points
- Geometric Avatar Problems
- NP-Completeness of Spreading Colored Points
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
- Minimal Triangulations of Polygonal Domains
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- New Results on Stabbing Segments with a Polygon
- Stabbing parallel segments with a convex polygon
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
This page was built for publication: New results on stabbing segments with a polygon