| VRSTA GRADIVA | analitična raven (sestavni del), tekstovno gradivo, tiskano, 1.03 - kratki znanstveni prispevek |
| DRŽAVA IZIDA | Slovenija |
| LETO IZIDA | 2006 |
| JEZIK BESEDILA/IZVIRNIKA | angleški |
| PISAVA | latinica |
| AVTOR | Domiter, Vid - avtor |
| ODGOVORNOST | Žalik, Borut - avtor |
| NASLOV | Constrained Delaunay triangulation with sweeping |
| V PUBLIKACIJI | Contributions to geometric modelling and multimedia. - ISSN 1580-5689. - ǂVol. ǂ6, ǂno. ǂ3 (2006), str. 1-17. |
| KRATKA VSEBINA | This report presents a new algorithm for constrained Delaunay triangulation. Based on sweep-line paradigm, the algorithm builds constrained triangular mesh gradually by sweeping points and constraining edges. Majority of constrained Delaunay triangulation algorithms nm two separate tasks. First they insert points to build Delaunay triangulation and insert all constraints after wards. Yet proposedalgorithm performs both tasks at once. With the use of advancing front approach, new triangles are integrated in the current triangulation very quickly. Local legalization is performed to maintain weaker Delaunay property of triangles. To speed up the algorithm, heuristics is employed aswell. The algorithm proves to be fast and memory friendly. |
| OPOMBE | Bibliografija: str. 16-17 |
| OSTALI NASLOVI | Sweep-line algorithm for CDT // Omejena Delaunayeva triangulacija s prebiranjem |
| PREDMETNE OZNAKE | // Delaunayeva triangulacija // računalniška geometrija // GIS |
| UDK | 004.9 |