Sweep‐line algorithm for constrained Delaunay triangulation

@article{Domiter2008SweeplineAF,
  title={Sweep‐line algorithm for constrained Delaunay triangulation},
  author={V. Domiter and B. Zalik},
  journal={International Journal of Geographical Information Science},
  year={2008},
  volume={22},
  pages={449 - 462}
}
  • V. Domiter, B. Zalik
  • Published 2008
  • Mathematics, Computer Science
  • International Journal of Geographical Information Science
  • 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 by following the sweep‐line. It separates the triangulated and non‐triangulated regions of… CONTINUE READING
    42 Citations
    A fast algorithm for constructing approximate medial axis of polygons, using Steiner points
    • 9
    Triangulation of an elevation surface structured by a sparse 3D grid
    • 3
    Generating seamless surfaces for transport and dispersion modeling in GIS
    • 13
    • PDF
    Change detection for 3D vector data: a CGA-based Delaunay–TIN intersection approach
    • 15
    • PDF
    Incremental and batch planar simplification of dense point cloud maps
    • 32
    • Highly Influenced
    • PDF
    Planar simplification and texturing of dense point cloud maps
    • 17
    • Highly Influenced
    • PDF
    Edge routing with ordered bundles
    • 21

    References

    SHOWING 1-10 OF 23 REFERENCES
    An efficient sweep-line Delaunay triangulation algorithm
    • 32
    An improved incremental algorithm for constructing restricted delaunay triangulations
    • M. Anglada
    • Mathematics, Computer Science
    • Comput. Graph.
    • 1997
    • 82
    • PDF
    Constrained delaunay triangulations
    • L. Chew
    • Computer Science
    • Algorithmica
    • 2005
    • 396
    • PDF
    Two algorithms for constructing a Delaunay triangulation
    • D. Lee, B. Schachter
    • Computer Science
    • International Journal of Computer & Information Sciences
    • 2004
    • 1,016
    • PDF
    Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
    • 77
    • PDF
    Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
    • 184
    • PDF
    Software for C1 Surface Interpolation
    • 716
    Randomized incremental construction of Delaunay and Voronoi diagrams
    • 363
    • PDF
    A sweepline algorithm for Voronoi diagrams
    • S. Fortune
    • Mathematics, Computer Science
    • SCG '86
    • 1986
    • 629
    • PDF
    An Original Way of Building a TIN with Complex Urban Structures
    • 3
    • PDF