MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
From MaRDI portal
Publication:4848831
DOI10.1142/S0218195995000143zbMath0834.68119OpenAlexW2104800753MaRDI QIDQ4848831
Publication date: 20 September 1995
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195995000143
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (17)
Minimal surface convex hulls of spheres ⋮ On intersecting a set of parallel line segments with a convex polygon of minimum area ⋮ Largest and smallest convex hulls for imprecise points ⋮ Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments ⋮ The touring rays and related problems ⋮ Algorithms for interval structures with applications ⋮ Minimum-perimeter intersecting polygons ⋮ New results on stabbing segments with a polygon ⋮ Stabbing segments with rectilinear objects ⋮ Algorithms for Interval Structures with Applications ⋮ THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE ⋮ Stabbing circles for sets of segments in the plane ⋮ Stabbers of line segments in the plane ⋮ Largest bounding box, smallest diameter, and related problems on imprecise points ⋮ Polynomial-time algorithms for the touring rays and related problems ⋮ ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
This page was built for publication: MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
