Post-optimization of Delaunay tetrahedrization

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F01%3A00065261" target="_blank" >RIV/49777513:23520/01:00065261 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Post-optimization of Delaunay tetrahedrization
Popis výsledku v původním jazyce
Triangulation of a given set of points in a plane is one of the most commonly solved problems in computer graphics and computional geometry. Many criteria have been developed to provide such meshes, namely weight and angular criteria. By any of the existing deterministic methods,it is not possible to compute a triangulation which satisfies more than one criterion or which contains parts developed according to several criteria. We explain how such a mixture can be generated using genetic optimization.
Název v anglickém jazyce
Post-optimization of Delaunay tetrahedrization
Popis výsledku anglicky
Triangulation of a given set of points in a plane is one of the most commonly solved problems in computer graphics and computional geometry. Many criteria have been developed to provide such meshes, namely weight and angular criteria. By any of the existing deterministic methods,it is not possible to compute a triangulation which satisfies more than one criterion or which contains parts developed according to several criteria. We explain how such a mixture can be generated using genetic optimization.

Rok uplatnění
2001
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ů

Podobné výsledky(10)