Stabbing circles for sets of segments in the plane
DOI10.1007/s00453-017-0299-zzbMath1453.68203OpenAlexW2595366753MaRDI QIDQ1742369
Mercè Claverol, Elena Khramtcova, Maria Saumell, Evanthia Papadopoulou, 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
Voronoi diagramHausdorff Voronoi diagramfarthest-color Voronoi diagramcluster Voronoi diagramsstabbing circlestabbing line segments
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Cites Work
- Unnamed Item
- Convex transversals
- New results on stabbing segments with a polygon
- Stabbers of line segments in the plane
- Farthest-polygon Voronoi diagrams
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters
- Farthest line segment Voronoi diagrams
- The upper envelope of piecewise linear functions: Algorithms and applications
- Voronoi diagrams and arrangements
- Stabbing line segments
- Concrete and abstract Voronoi diagrams
- The upper envelope of Voronoi surfaces and its applications
- Ray shooting in polygons using geodesic triangulations
- Stabbing segments with rectilinear objects
- The Hausdorff Voronoi diagram of point clusters in the plane
- Bichromatic 2-center of pairs of points
- Stabbing Circles for Sets of Segments in the Plane
- Voronoi Diagrams and Delaunay Triangulations
- ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH
This page was built for publication: Stabbing circles for sets of segments in the plane