Post-optimization of Delaunay tetrahedrization
The result's identifiers
Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Post-optimization of Delaunay tetrahedrization
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
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
Article name in the collection
Post-optimization of Delaunay tetrahedrization
ISBN
0769512151
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Los Alamitos
Event date
Jan 1, 2001
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—