A fast approximation of the Voronoi diagram for a set of pairwise disjoint arcs
Files
Date issued
2018
Journal Title
Journal ISSN
Volume Title
Publisher
Václav Skala - UNION Agency
Abstract
We propose a method for fast approximation of the Voronoi diagram for a set of pairwise disjoint arcs on a plane.
The arcs are represented by parameterized curves. A set of input curves is discretized into partition set, for which
the Voronoi diagram is constructed. After merging corresponding Voronoi cells and removing redundant edges,
the Voronoi graph is approximated by Bezier curves. We also propose the elaboration and optimization of the
approximation. The total complexity of the algorithm is ONlogN in the worst-case.
Description
Subject(s)
přiblížení, Voroného diagram, Voroného buňka, Bezierova křivka, diskretizace, rozdělení sad, parametrická křivka
Citation
WSCG '2018: short communications proceedings: The 26th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2016 in co-operation with EUROGRAPHICS: University of West Bohemia, Plzen, Czech Republic May 28 - June 1 2018, p. 7-12.