Results 161 to 170 of about 681,623 (204)
Triangle refinement in a constrained Delaunay triangulation skeleton
Pattern Recognition, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ju Jia Zou
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Algorithm for constrained delaunay triangulation
Visual Computer, 1994A direct algorithm for computing constrained Delaunay triangulation in 2-D is presented. The algorithm inserts points along the constrained edges (break lines) to maintain the Delaunay criterion. Since many different insertions are possible, the algorithm computes only those that are on the Delaunay circles of each intersected triangle.
Les A. Piegl
exaly +3 more sources
The Employment of Regular Triangulation for Constrained Delaunay Triangulation
Lecture Notes in Computer Science, 2004We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constrained Delaunay triangulation based on the use of regular triangulation. As far as we know, such a connection has not been presented yet in the literature and there is no algorithm based on
Ivana Kolingerova
exaly +3 more sources
Sweep‐line algorithm for constrained Delaunay triangulation
International Journal of Geographical Information Science, 2008This 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
B Zalik
exaly +2 more sources
Computing constrained triangulation and Delaunay triangulation: a new algorithm
IEEE Transactions on Magnetics, 1990A novel algorithm for computing optimal constrained triangulation is presented which is equally applicable to 2-D and 3-D optimal constrained triangulation and Delaunay triangulation. This algorithm has no degenerate and near-degenerate problems. The same amount of time is needed to add a new point to an existing mesh of any element number provided ...
null Zhou Jian-Ming +3 more
exaly +2 more sources
Capacity-Constrained Delaunay Triangulation for point distributions
Computers and Graphics, 2011Craig Gotsman +2 more
exaly +3 more sources
A Constrained Delaunay Triangulation Algorithm Based on Incremental Points
Applied Mechanics and Materials, 2011 The foundation ofdelaunay triangulationandconstrained delaunay triangulationis the basis of three dimensional geographical information system which is one of hot issues of the contemporary era; moreover it is widely applied in finite element methods ...
Ai Ping Tang
exaly +2 more sources
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time [PDF]
SIAM Journal on Computing, 1998 In this paper, we present an Θ(n) time worst-case deterministic algorithm for finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple n-sided polygon in the plane.
Cao An Wang
exaly +3 more sources
The Delaunay constrained triangulation: the Delaunay stable algorithms
1999 IEEE International Conference on Information Visualization (Cat. No. PR00210), 2003Delaunay triangulation is well known for its use in geometric design. A derived version of this structure, the Delaunay constrained triangulation, takes into account the triangular mesh problem in presence of rectilinear constraints. The Delaunay constrained triangulation is very useful for CAD, topography and mapping and in finite element analysis ...
L. Rognant +3 more
openaire +2 more sources
An on-line algorithm for constrained Delaunay triangulation
CVGIP: Graphical Models and Image Processing, 1992Abstract 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 ...
DE FLORIANI, LEILA, PUPPO, ENRICO
openaire +2 more sources