Vés al contingut (premeu Retorn)

Stabbing circles for some sets of Delaunay segments

Claverol, M.; Khramtcova, E.; Papadopoulou, E.; Saumell, M.; Seara, C.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
32nd European Workshop on Computational Geometry
Any de l'edició
Data de presentació
Llibre d'actes
EuroCG 2016: 32nd European Workshop on Computational Geometry March 30 – April 1, 2016 Book of Abstracts
Pàgina inicial
Pàgina final
Repositori Obrir en finestra nova
URL Obrir en finestra nova
Let S be a set of n segments in the plane such that, for every segment, its two endpoints are adjacent in the Delaunay triangulation of the set of endpoints of all segments in S. Our goal is to compute all the combinatorially different stabbing circles for S, and the ones with maximum and minimum radius. We exploit a recent result to solve this problem in O(n log n) in two particular cases: (i) all segments in S are parallel; (ii) all segments in S have the same length. We also show that the pro...
Paraules clau
Stabbing, Circles, Delaunay, Segments
Grup de recerca
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta