Fast Discovery of Voronoi Vertices in the Construction of Voronoi Diagram of 3D Balls

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F10%3A00504004" target="_blank" >RIV/49777513:23520/10:00504004 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Fast Discovery of Voronoi Vertices in the Construction of Voronoi Diagram of 3D Balls
Original language description
Solving geometrical problems on a set of 3D balls is a challenging task in computational geometry. They can be solved effectively when the Voronoi diagram for the set is available. The diagram is usually constructed by the edge-tracing or similar algorithms based on finding Voronoi vertices along edges. However, its expected quadratic time complexity makes it impractical. This can be improved significantly by our new approach. Whenever a vertex needs to be found, Delaunay triangulation of ball centers is searched through to find one specific ball. The search is kept inside a spatial filter, which can be reduced in size during the search. The improvement is demonstrated on protein data (a set of balls represents atoms in a molecule), because this is ourintended application.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F10%2F1435" target="_blank" >GAP202/10/1435: Analysis and Visualization of Protein Structures</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
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)