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

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F10%2F1435" target="_blank" >GAP202/10/1435: Analýza a vizualizace proteinových struktur</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2010

Kód důvěrnosti údajů

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

Název statě ve sborníku

Voronoi Diagrams in Science and Engineering

ISBN

978-0-7695-4112-9

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

95-104

Název nakladatele

IEEE

Místo vydání

Los Alamitos

Místo konání akce

Quebec, Kanada

Datum konání akce

28. 6. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—