Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Stabbing circles for sets of segments in the plane

Autor
Claverol, M.; Khramtcova, E.; Papadopoulou, E.; Saumell, M.; Seara, C.
Tipus d'activitat
Article en revista
Revista
Algorithmica
Data de publicació
2018-03
Volum
80
Número
3
Pàgina inicial
849
Pàgina final
884
DOI
https://doi.org/10.1007/s00453-017-0299-z Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/104128 Obrir en finestra nova
URL
http://link.springer.com/article/10.1007%2Fs00453-017-0299-z Obrir en finestra nova
Resum
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-color Voronoi diagram. Based on these diagrams, we provide a method to compute a representation of all the combinatorially different stabbing circles for S, and the stabbing circles with maximum and ...
Citació
Claverol, M., Khramtcova, E., Papadopoulou, E., Saumell, M., Seara, C. Stabbing circles for sets of segments in the plane. "Algorithmica", 13 Març 2017, p. 1-36.
Paraules clau
Cluster Voronoi diagrams, Farthest-color Voronoi diagram, Hausdorff Voronoi diagram, Stabbing circle, Stabbing line segments, Voronoi diagram
Grup de recerca
CGA -Computational Geometry and Applications

Participants

Arxius