All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Compact storage of additively weighted Voronoi diagrams

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F22%3A43967390" target="_blank" >RIV/49777513:23520/22:43967390 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/article/10.1007/s00371-022-02667-z" target="_blank" >https://link.springer.com/article/10.1007/s00371-022-02667-z</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s00371-022-02667-z" target="_blank" >10.1007/s00371-022-02667-z</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Compact storage of additively weighted Voronoi diagrams

  • Original language description

    Voronoi diagrams and their dual tetrahedral structures are often utilized in various analyses of protein models where atoms are represented as balls. The additively weighted kind of Voronoi diagrams (aw-VD) is particularly useful in this area because it includes the variability of ball size. The dynamic behavior of proteins can be realistically modeled by a simulation of molecular dynamics recording atom positions at discrete snapshots of time. However, aw-VDs for these snapshots require a lot of storage. This is where domain-specific compression could help, but available algorithms are oriented primarily to the compression of ordinary tetrahedral meshes, not to aw-VDs whose dual tetrahedral structure may have anomalies complicating duality inversion and tetrahedral mesh traversal. Therefore, we propose a method that can compactly store the dual tetrahedral structure. The method is built on general ideas of an already known cut-border machine and improves these ideas in several ways so it can be applied to aw-VDs and perform well on protein data.

  • 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2022

  • 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

    Visual Computer

  • ISSN

    0178-2789

  • e-ISSN

    1432-2315

  • Volume of the periodical

    39

  • Issue of the periodical within the volume

    11

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    15

  • Pages from-to

    5389-5404

  • UT code for WoS article

    000866293500001

  • EID of the result in the Scopus database

    2-s2.0-85139672693