Stabbing Circles for Sets of Segments in the Plane

Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected to two cluster Voronoi diagrams, in particular, the Hausdorff and the farthest...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 80; no. 3; pp. 849 - 884
Main Authors:	Claverol, Mercè, Khramtcova, Elena, Papadopoulou, Evanthia, Saumell, Maria, Seara, Carlos
Format:	Journal Article Publication
Language:	English
Published:	New York Springer US 01.03.2018 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Cluster Voronoi diagrams Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Farthest-color Voronoi diagram Geometria computacional Hausdorff Voronoi diagram Informàtica Lower bounds Matemàtiques i estadística Mathematics of Computing Segments Special Issue on Theoretical Informatics Stabbing circle Stabbing line segments Theory of Computation Voronoi diagram Voronoi graphs Voronoi polygons Àrees temàtiques de la UPC Voronoi diagram Hausdorff Voronoi diagram Cluster Voronoi diagrams Stabbing circle Stabbing line segments Farthest-color Voronoi diagram
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!