VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Sweep-line algorithm for constrained Delaunay triangulation
    Domiter, Vid ; Žalik, Borut
    This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining edges. It has various applications in geographical information system ... (GIS), for example, iso-lines triangulation or the triangulation of polygons in land cadastre. The presented algorithm uses a sweep-line paradigm combined with Lawson's legalisation. An advancing front moves bz following the sweep-line. It separates the triangulated and non-triangulated regions of interest. Our algorithm simultaneously triangulates points and constraining edges and thus avoids consuming location of those triangles containing constraining edges, asused by other approaches. The implementation of the algorithm is also considerably simplified by introducing two additional artificial points. Experiments show that the presented algorithm is among the fastest constrained Delaunay triangulation algorithms available at the moment.
    Vir: International journal of geographical information science. - ISSN 1365-8816 (Vol. 22, iss. 4, Apr. 2008, str. 449-462)
    Vrsta gradiva - članek, sestavni del
    Leto - 2008
    Jezik - angleški
    COBISS.SI-ID - 12266774
    DOI

Vnos na polico