Reference : Delaunay Triangulations of Points on Circles
E-prints/Working papers : Already available on another site
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/35413
Delaunay Triangulations of Points on Circles
English
despré, vincent [inria > loria]
devillers, olivier [inria > loria]
Parlier, Hugo mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
Schlenker, Jean-Marc mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
Mar-2018
1
12
No
[en] Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry.
Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but since it is not a generic situation, this difficulty is usually handled by using a (symbolic or explicit) perturbation. As an alternative, we propose to define a canonical triangulation for a set of concyclic points by using a max-min angle characterization of Delaunay triangulations. This point of view leads to a well defined and unique triangulation as long as there are no symmetric quadruples of points. This unique triangulation can be computed in quasi-linear time by a very simple algorithm.
Fonds National de la Recherche - FnR ; ANR
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/35413
https://arxiv.org/abs/1803.11436

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
1803.11436.pdfAuthor preprint658.66 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.