The employment of regular triangulation for constrained delaunay triangulation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F04%3A00000168" target="_blank" >RIV/49777513:23520/04:00000168 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The employment of regular triangulation for constrained delaunay triangulation
Original language description
We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constrained Delaunay triangulation based on the use of regular triangulation.
Czech name
Využití regulární triangulace pro Delaunayovu triangulace s omezením
Czech description
Ukazujeme souvislost mezi regulární a delaunayovou triangulací s omezením 2D. Navrhujeme algoritmus pro vnucení hran do delaunayovy triangulace s omezením založený na použití regulární triangulace.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
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
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
—
Issue of the periodical within the volume
—
Country of publishing house
DE - GERMANY
Number of pages
9
Pages from-to
198
UT code for WoS article
—
EID of the result in the Scopus database
—