Vés al contingut (premeu Retorn)

Stabbing circles for sets of segments in the plane

Claverol, M.; Khramtcova, E.; Papadopoulou, E.; Saumell, M.; Seara, C.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
12th Latin American Theoretical Informatics Symposium
Any de l'edició
Data de presentació
Llibre d'actes
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016: proceedings
Pàgina inicial
Pàgina final
DOI Obrir en finestra nova
Repositori Obrir en finestra nova
URL Obrir en finestra nova
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 cluster Voronoi diagrams, in particular, the Hausdorff and the farthest-color Voronoi diagram. Based on these diagrams, we provide a method to compute all the combinatorially different stabbing circles for S, and the stabbing circles with maximum and minimum radius. We give ...
Claverol, M., Khramtcova, E., Papadopoulou, E., Saumell, M., Seara, C. Stabbing circles for sets of segments in the plane. A: LATIN - Theoretical Informatics. Latin American Symposium. "LATIN 2016: Theoretical Informatics. 12th Latin American Symposium". Ensenada: 2016, p. 290-305.
Paraules clau
Computational geometry, Farthest-color Voronoi diagram, Hausdorff space, Segment set, Stabbing circles, Stabbing object
Grup de recerca
CGA -Computational Geometry and Applications