Extension of the edge tracing algorithm to disconnected Voronoi skeletons

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F16%3A43926859" target="_blank" >RIV/49777513:23520/16:43926859 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ipl.2015.09.017" target="_blank" >http://dx.doi.org/10.1016/j.ipl.2015.09.017</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ipl.2015.09.017" target="_blank" >10.1016/j.ipl.2015.09.017</a>

Result language
angličtina
Original language name
Extension of the edge tracing algorithm to disconnected Voronoi skeletons
Original language description
One of the ways how to describe spatial relations among balls in Euclidean space is to use an additively weighted Voronoi diagram, where each ball has a region of closest points assigned to it. The boundary of regions is formed by non-linear faces, edges and vertices. Edges and vertices form a skeleton of the diagram. An edge tracing algorithm exists, which finds an initial vertex and then traces edges until the whole component is discovered. The problem is that the skeleton can have more components but the algorithm does not necessarily discover them all. We introduce an extension of the edge tracing algorithm to discover all components.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/LO1506" target="_blank" >LO1506: Sustainability support of the centre NTIS - New Technologies for the Information Society</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)