Title: A fast approximation of the Voronoi diagram for a set of pairwise disjoint arcs
Authors: Kotsur, Dmytro
Tereshchenko, Vasyl
Tereshchenko, Yaroslav
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.
Issue Date: 2018
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: wscg.zcu.cz/WSCG2018/!!_CSRN-2802.pdf
ISBN: 978-80-86943-41-1
ISSN: 2464-4617
Keywords: přiblížení;Voroného diagram;Voroného buňka;Bezierova křivka;diskretizace;rozdělení sad;parametrická křivka
Keywords in different language: approximation;Voronoi diagram;Voronoi cell;Bezier curve;discretization;partition set;parametric curve
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.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2018: Short Papers Proceedings

Files in This Item:
File Description SizeFormat 
Kotsur.pdfPlný text1,41 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/34646

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.