Evaluation of Continuous Collision Detection Accelerated with Tetrahedral Structures

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00092344" target="_blank" >RIV/00216224:14330/16:00092344 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1145/2948628.2948639" target="_blank" >http://dx.doi.org/10.1145/2948628.2948639</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2948628.2948639" target="_blank" >10.1145/2948628.2948639</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Evaluation of Continuous Collision Detection Accelerated with Tetrahedral Structures

Popis výsledku v původním jazyce

Continuous collision detection provides very good information about the interaction between objects. In this paper, we present a new method for computing the continuous collision detection between a static and a moving triangle mesh. We target our method on open triangle meshes, and focus on their small movements. To accelerate the computation, we divide the space inside and around the meshes into tetrahedra. The main idea of our method is to maintain the list of tetrahedra, in which the individual primitives of the meshes are located, to compute collisions only in these tetrahedra, and to update the list as the primitives move. We measure the performance of our algorithm and discuss its advantages and limitations. We also compare our algorithm with other solutions.

Název v anglickém jazyce

Evaluation of Continuous Collision Detection Accelerated with Tetrahedral Structures

Popis výsledku anglicky

Continuous collision detection provides very good information about the interaction between objects. In this paper, we present a new method for computing the continuous collision detection between a static and a moving triangle mesh. We target our method on open triangle meshes, and focus on their small movements. To accelerate the computation, we divide the space inside and around the meshes into tetrahedra. The main idea of our method is to maintain the list of tetrahedra, in which the individual primitives of the meshes are located, to compute collisions only in these tetrahedra, and to update the list as the primitives move. We measure the performance of our algorithm and discuss its advantages and limitations. We also compare our algorithm with other solutions.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2016

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

Proceedings of the 32nd Spring Conference on Computer Graphics (SCCG '16)

ISBN

9781450344364

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

17-23

Název nakladatele

ACM

Místo vydání

New York, NY, USA

Místo konání akce

Smolenice, Slovakia

Datum konání akce

1. 1. 2016

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

WRD - Celosvětová akce

Kód UT WoS článku

—