DIKUL - logo
(UL)
  • Constrained Delaunay triangulation with sweeping
    Domiter, Vid ; Žalik, Borut
    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 proposed algorithm 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 as well. The algorithm proves to be fast and memory friendly.
    Vrsta gradiva - elaborat, študija
    Založništvo in izdelava - Maribor : Faculty of Electrical Engineering and Computer Science, Laboratory for geometric modelling and multimedia algorihtms, 2006
    Jezik - angleški
    COBISS.SI-ID - 13075478

Knjižnica Signatura – lokacija, inventarna št. ... Status izvoda
Narodna in univerzitetna knjižnica, Ljubljana glavno skladišče 609644/2006 gl. publikacijo
loading ...
loading ...
loading ...