Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation

: In this work we describe a novel technique for semi‐automatic three‐dimensional (3D) reconstruction of urban areas, from airborne stereo‐pair images whose output is VRML or DXF. The main challenge is to compute the relevant information—building's height and volume, roof's description, and texture—algorithmically, because it is very time consuming and thus expensive to produce it manually for large urban areas. The algorithm requires some initial calibration input and is able to compute the above‐mentioned building characteristics from the stereo pair and the availability of the 2D CAD and the digital elevation model of the same area, with no knowledge of the camera pose or its intrinsic parameters. To achieve this, we have used epipolar geometry, homography computation, automatic feature extraction and we have solved the feature correspondence problem in the stereo pair, by using template matching.

show abstract

“…We have initially adopted a Delaunay Triangulation technique, based on the Voronoy Diagram (Baker 1989), whose result can be seen in Fig. 6 -top.…”

Section: Dtm Generatormentioning

confidence: 99%

Semi-Automatic 3D Reconstruction of Urban Areas Using Epipolar Geometry and Template Matching

Dias

Bastos

Correia

et al. 2006

Computer-aided Civil Eng

View full text Add to dashboard Cite

show abstract

“…Due to the complexity of technical objects and the high cost of creating and testing prototypes, modeling [10] and simulation are the solutions for solving these problems and also for optimizing time. The data structures [2][3][4] provide the backbone for physical analysis of the finite element method. This latter is based on a geometrical modeling [10].…”

Section: Introductionmentioning

confidence: 99%

Three-dimensional mesh generation using Delaunay triangulation

Kennassi¹,

Bousshine²

2014

IOSRJMCE

View full text Add to dashboard Cite

“…See e.g. the papers of Baker [6,7], Bouraki and George [9], Jones and Plassmann [23,24], Williams [55].…”

Section: Introductionmentioning

confidence: 99%

“…Computational methods for generating and refining triangular and tetrahedral finite element meshes in 2 and 3-dimensions can be roughly classified as Delaunay based methods, [6,19,7,17,50,47] and methods based on the partition of triangles and tetrahedra [39,33,34,28].…”

Section: Introductionmentioning

confidence: 99%

Multithread parallelization of Lepp-bisection algorithms

Rivara

Rodríguez

Montenegro

et al. 2012

Applied Numerical Mathematics

View full text Add to dashboard Cite

Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge. The process is repeated until triangle t is destroyed. We discuss the algorithm, related synchronization issues, and the properties inherited from the serial algorithm. We present an empirical study that shows that a reasonably efficient parallel method with good scalability was obtained. Multithread parallelization of lepp-bisection algorithms AbstractLongest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge. The process is repeated until triangle t is destroyed. We discuss the algorithm, related synchronization issues, and the properties inherited from the serial algorithm. We present an empirical study that shows that a reasonably efficient parallel method with good scalability was obtained.

show abstract

Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation

Cited by 185 publications

References 22 publications

Semi-Automatic 3D Reconstruction of Urban Areas Using Epipolar Geometry and Template Matching

Semi-Automatic 3D Reconstruction of Urban Areas Using Epipolar Geometry and Template Matching

Three-dimensional mesh generation using Delaunay triangulation

Multithread parallelization of Lepp-bisection algorithms

Contact Info

Product

Resources

About