Kinetic locally minimal triangulation: theoretical evaluation and combinatorial analysis
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F20%3A43957595" target="_blank" >RIV/49777513:23520/20:43957595 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s00371-019-01657-y" target="_blank" >https://link.springer.com/article/10.1007/s00371-019-01657-y</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00371-019-01657-y" target="_blank" >10.1007/s00371-019-01657-y</a>
Alternative languages
Result language
angličtina
Original language name
Kinetic locally minimal triangulation: theoretical evaluation and combinatorial analysis
Original language description
Kinetic data structures represent an extension to ordinary data structures, where the underlying data become time-dependent (e.g., moving points). In this paper, we define the kinetic locally minimal triangulation (KLMT) as a kinetic data structure extension to the locally minimal triangulation in the Euclidean plane. We explore the general properties of this data structure in order to show what types of events need to be considered during its lifecycle; we also describe the predicates associated with these events. To describe the general kinetic features, we prove that KLMT is responsive, compact, efficient, and non-local. In the combinatorial analysis of KLMT, we briefly describe the mathematical apparatus commonly used to investigate computational complexity properties of kinetic data structures and use it to establish the bounds on the number of events processed during the lifecycle of this data structure. Finally, the obtained results are compared to the kinetic Delaunay triangulation showing that KLMT may provide some benefits over kinetic Delaunay triangulation, namely simplifying the mathematical equations that need to be computed in order to obtain the times of events.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA17-07690S" target="_blank" >GA17-07690S: Methods of Identification and Visualization of Tunnels for Flexible Ligands in Dynamic Proteins</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
The Visual Computer
ISSN
0178-2789
e-ISSN
—
Volume of the periodical
36
Issue of the periodical within the volume
4
Country of publishing house
DE - GERMANY
Number of pages
9
Pages from-to
757-765
UT code for WoS article
000520835800008
EID of the result in the Scopus database
2-s2.0-85065396547