Loading...
Loading...

Go to the content (press return)

Stabbing circles for some sets of Delaunay segments

Author
Claverol, M.; Khramtcova, E.; Papadopoulou, E.; Saumell, M.; Seara, C.
Type of activity
Presentation of work at congresses
Name of edition
32nd European Workshop on Computational Geometry
Date of publication
2016
Presentation's date
2016-03-31
Book of congress proceedings
EuroCG 2016: 32nd European Workshop on Computational Geometry March 30 – April 1, 2016 Book of Abstracts
First page
139
Last page
142
Repository
http://hdl.handle.net/2117/102530 Open in new window
URL
http://www.eurocg2016.usi.ch/ Open in new window
Abstract
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...
Citation
Claverol, M., Khramtcova, E., Papadopoulou, E., Saumell, M., Seara, C. Stabbing circles for some sets of Delaunay segments. A: European Workshop on Computational Geometry. "EuroCG 2016: 32nd European Workshop on Computational Geometry March 30 – April 1, 2016 Book of Abstracts". Lugano: 2016, p. 139-142.
Keywords
Circles, Delaunay, Segments, Stabbing
Group of research
CGA -Computational Geometry and Applications

Participants

  • Claverol Aguas, Mercè  (author and speaker )
  • Khramtcova, Elena  (author and speaker )
  • Papadopoulou, Evanthia  (author and speaker )
  • Saumell, Maria  (author and speaker )
  • Seara Ojea, Carlos  (author and speaker )

Attachments