An on-line algorithm for constrained Delaunay triangulation

doi:10.1016/1049-9652(92)90076-A

CVGIP: Graphical Models and Image Processing

Volume 54, Issue 4, July 1992, Pages 290-300

CVGIP: Graphical Mod...

https://doi.org/10.1016/1049-9652(92)90076-A Get rights and content

Abstract

A constrained Delaunay triangulation is a Delaunay triangulation of a set of points and straight-line segments. A constrained Delaunay triangulation is a basic tool for describing a topographic surface in several applications. In this paper, the definition of constrained Delaunay triangulation is introduced and its basic properties are discussed. Existing algorithms for constrained Delaunay triangulation are briefly analyzed. A new on-line algorithm for constrained Delaunay triangulation that is based on the stepwise refinement of an existing triangulation by the incremental insertion of points and constraint segments is proposed.

References (33)

R.E Barnhill
Representation and approximation of surfaces
J.D Boissonnat
Shape reconstruction from planar cross sections
Comput. Vision Graphics Image Process.
(1988)
L De Floriani et al.
A Delaunay-based representation of surfaces defined over arbitrarily-shaped domains
Comput. Vision Graphics Image Process.
(1985)
T.K Peucker et al.
Detection of surface-specific points by local parallel processing of discrete terrain elevation data
Comput. Graphics Image Process.
(1975)
T Asano et al.
Visibility of disjoint polygons
Algorithmica
(1986)
I Babuska et al.
On the angle condition in the finite element method
SIAM J. Numer. Anal.
(1976)
J Bernal
On constructing Delaunay triangulations for sets of constrained line segments
J.D Boissonnat
Geometric structures for three dimensional shape representation
ACM Trans. Graphics
(1984)
J.H Bramble et al.
Triangular elements in the finite element method
Math. Comp.
(1970)
E Bruzzone et al.
Three-dimensional surface reconstruction using Delaunay triangulation in the image plane

J.C Cavendish

Automatic triangulation of arbitrary planar domains for the finite element method

Int. J. Numer. Methods Engrg.

(1978)

B.M Chazelle et al.

Triangulating a polygon by divide-and-conquer

L.P Chew

Constrained Delaunay triangulation

K Clarkson et al.

Application of random sampling in computational geometry, II

Discrete Comput. Geom.

(1989)

L De Floriani et al.

Constrained Delaunay triangulation for multiresolution surface description

L De Floriani

A pyramidal data structure for triangle-based surface description

Cited by (92)

Deep learning of curvature features for shape completion
2023, Computers and Graphics (Pergamon)
The paper presents a novel solution to the issue of incomplete regions in 3D meshes obtained through digitization. Traditional methods for estimating the surface of missing geometry and topology often yield unrealistic outcomes for intricate surfaces. To overcome this limitation, the paper proposes a neural network-based approach that generates points in areas where geometric information is lacking. The method employs 2D inpainting techniques on color images obtained from the original mesh parameterization and curvature values. The network used in this approach can reconstruct the curvature image, which then serves as a reference for generating a polygonal surface that closely resembles the predicted one. The paper’s experiments show that the proposed method effectively fills complex holes in 3D surfaces with a high degree of naturalness and detail. This paper improves the previous work in terms of a more in-depth explanation of the different stages of the approach as well as an extended results section with exhaustive experiments.
Impacts of surface model generation approaches on raytracing-based solar potential estimation in urban areas
2022, Renewable Energy
Citation Excerpt :
The most common approach to conduct Delaunay-based reconstruction is inspired by Bowyer [44] and Watson [45], using a recursive method to locate triangles among the point set, thus making sure that there are no points inside the circumcircle of any triangle. Besides, the triangulation process can be constrained in multiple subsets of the point cloud [46,47]. We refer to this approach as the generic Delaunay algorithm.
Raytracing-based methods are widely used for quantifying irradiation on building surfaces. Urban 3D surface models are necessary input for raytracing simulations, which can be generated from open-source point cloud data with the help of surface reconstruction algorithms. In research and engineering practice, various algorithms are being used for this purpose; each leading to different mesh topologies and corresponding performance. This paper compares the impacts of four different reconstruction algorithms by investigating their performance using DAYSIM raytracing simulations. The analysis is carried out for five configurations with various urban morphologies. Results show that the reconstructed models consistently underestimate the shading influence due to geometrical shrinkages that emerge from the various model generation procedures. The explicit algorithms, with Generic Delaunay a notable example, have better performance with less embedded error than the implicit algorithms in both daily and annual simulations. Results also show that diffuse irradiance is responsible for larger contributions to the overall error than direct components. This effect becomes more prominent when modeling reflected irradiation in urban environments. Additionally, the work shows that solar elevation and shading geometry types also affect the error magnitude. The paper concludes by providing reconstruction algorithm selection criteria for photovoltaic practitioners and urban energy planners.
Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve
2016, Computers and Graphics (Pergamon)
Citation Excerpt :
Among these algorithms, the incremental insertion algorithm has become popular for its specific advantages—simplicity, small space occupancy and convenience for dynamic update. With the successive developments by Lee and Schachter [14], Bowyer [15], Watson [16], Sloan [17], Macedonio and Pareschi [18], De Floriani and Puppo [19] and Tsai [20], the incremental insertion algorithm is formed with the major processes of the bounding box creating, point locating, cavity expanding and triangle mesh updating [21]. On this basis, several approaches were proposed to improve the incremental insertion algorithm.
Given the enormous scale and diverse distribution of 2D point cloud data, an adaptive Hilbert curve insertion algorithm which has quasi-linear time complexity is proposed to improve the efficiency of Delaunay triangulation. First of all, a large number of conflicting elongated triangles, which have been created and deleted many times, can be reduced by adopting Hilbert curve traversing multi-grids. In addition, searching steps for point location can be reduced by adjusting Hilbert curve׳s opening direction in adjacent grids to avoid the “jumping” phenomenon. Lastly, the number of conflicting elongated triangles can be further decreased by adding control points during traversing grids. The experimental results show that the efficiency of Delaunay triangulation by the adaptive Hilbert curve insertion algorithm can be improved significantly for both uniformly and non-uniformly distributed point cloud data, compared with CGAL, regular grid insertion and multi-grid insertion algorithms.
Investigations on the polygonal finite element method: Constrained adaptive Delaunay tessellation and conformal interpolants
2013, Computers and Structures
We present a polygonal finite element method based on constrained adaptive Delaunay tessellation and conformal interpolants on arbitrary polygons. For mesh generation we use the adaptive Delaunay tessellation, an unstructured hybrid tessellation of a scattered point set that minimally covers the proximal space around each point, which is here extended to non-convex domains. Various types of polygonal interpolants are implemented. For the numerical integration of the Galerkin weak form we resort to classical Gaussian quadrature applied on triangular subdomains. The performance and efficiency of the interpolation and implementation are investigated for two dimensional elasticity in a stochastical analysis on random and regular meshes.
Polygon Area Decomposition Using a Compactness Metric
2023, SSRN
Deterministic Linear Time Constrained Triangulation Using Simplified Earcut
2022, IEEE Transactions on Visualization and Computer Graphics

View all citing articles on Scopus

View full text

An on-line algorithm for constrained Delaunay triangulation

Abstract

Comput. Vision Graphics Image Process.

Comput. Vision Graphics Image Process.

Comput. Graphics Image Process.

Visibility of disjoint polygons

Algorithmica

On the angle condition in the finite element method

SIAM J. Numer. Anal.

On constructing Delaunay triangulations for sets of constrained line segments

Geometric structures for three dimensional shape representation

ACM Trans. Graphics

Triangular elements in the finite element method

Math. Comp.

Three-dimensional surface reconstruction using Delaunay triangulation in the image plane