Computing the Topology of Voronoi Diagrams of Parallel Half-Lines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematics in Computer Science Year : 2021

Computing the Topology of Voronoi Diagrams of Parallel Half-Lines

Abstract

In this paper we consider the Voronoï diagram of a finite family of parallel half-lines, with the same orientation, constrained to a compact domain D0⊂R3, with respect to the Euclidean distance. We present an efficient approximation algorithm for computing such VD, using a subdivision process, which produces a mesh representing the topology of the VD in D0. The computed topology may not be correct for degenerate configurations or configurations close to degenerate. In this case, the output is a valid partition, which is close to the exact partition in Voronoï cells if the input data were given with no error. We also present the result of an implementation in Julia language with visualization using Axl software (axl.inria.fr) of the algorithm. Some examples and analysis are shown.
Fichier principal
Vignette du fichier
Ibrahim_Bernard_VD_Hlines.pdf (1.92 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03200138 , version 1 (02-07-2021)

Licence

Copyright

Identifiers

Cite

Ibrahim Adamou, Bernard Mourrain. Computing the Topology of Voronoi Diagrams of Parallel Half-Lines. Mathematics in Computer Science, 2021, 15, pp.859-876. ⟨10.1007/s11786-021-00508-1⟩. ⟨hal-03200138⟩
167 View
95 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More