Stabbing circles for sets of segments in the plane
DOI10.1007/S00453-017-0299-ZzbMATH Open1453.68203OpenAlexW2595366753MaRDI QIDQ1742369FDOQ1742369
Authors: Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara
Publication date: 11 April 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/104128
Recommendations
Voronoi diagramHausdorff Voronoi diagramfarthest-color Voronoi diagramcluster Voronoi diagramsstabbing circlestabbing line segments
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- Voronoi diagrams and arrangements
- Stabbing line segments
- Concrete and abstract Voronoi diagrams
- Voronoi diagrams and Delaunay triangulations
- On the farthest line-segment Voronoi diagram
- Farthest-polygon Voronoi diagrams
- Farthest line segment Voronoi diagrams
- The upper envelope of Voronoi surfaces and its applications
- Optimal Search in Planar Subdivisions
- Title not available (Why is that?)
- Optimal Point Location in a Monotone Subdivision
- New results on stabbing segments with a polygon
- Bichromatic 2-center of pairs of points
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- Convex transversals
- Ray shooting in polygons using geodesic triangulations
- The Hausdorff Voronoi diagram of point clusters in the plane
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
- The upper envelope of piecewise linear functions: Algorithms and applications
- Stabbing circles for sets of segments in the plane
- Stabbers of line segments in the plane
Cited In (8)
- Stabbing pairwise intersecting disks by four points
- Stabbers of line segments in the plane
- On Covering Segments with Unit Intervals
- Stabbing pairwise intersecting disks by five points
- Stabbing circles for sets of segments in the plane
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
- Computational complexity for the problem of optimal intersection of straight line segments by disks
- Discrete and mixed two-center problems for line segments
This page was built for publication: Stabbing circles for sets of segments in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742369)