Journal Article10.1007/BF01901582
Algorithm for constrained Delaunay triangulation
Tsung-Pao Fang,Les A. Piegl +1 more
16
TL;DR: A direct algorithm for computing constrained Delaunay triangulation in 2-D is presented and a shelling procedure is applied to put triangles together in such a way that completeness and correctness are guaranteed.
read more
Abstract: A 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. A shelling procedure is applied to put triangles together in such a way that completeness and correctness are guaranteed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Generation of constrained Voronoi grid in a plane
Larisa V. Branets,Xiao-Hui Wu,Santosh K. Verma,Stephen L. Lyons +3 more
- 02 Apr 2008
TL;DR: In this paper, a method for generating constrained Voronoi grids in a plane with internal features and boundaries is disclosed, which generally includes approximation of internal feature and boundaries with polylines based on plane geometry.
44
Multiresolution representations for surfaces meshes based on the vertex decimation method
TL;DR: This paper enhances the 1996 mesh simplification algorithm with error control to preserve some information about the normals of the original faces into the resulting simplified data, which enables to build multiresolution models (MRM) which allow one to control the normal deviation and to extract view dependent-adaptive lighting sensitive approximations of the originally meshes.
44
Comparison of existing triangulation methods for regularly and irregularly spaced height fields
TL;DR: The traditional Delaunay triangulation is compared with several variant data-dependent triangulations based on Lawson's local optimization procedure (LOP), which is still the most successful technique for constructing TINs for approximating natural terrain surfaces.
30
Automated Generation of Geometrically-Precise and Semantically-Informed Virtual Geographic Environments Populated with Spatially-Reasoning Agents
Mehdi Mekni
- 29 Oct 2010
TL;DR: This thesis proposes a novel approach to automatically generate a semantically-enriched and geometrically-precise representation of the virtual environment known as Virtual Geographic Environment (VGE) for multi-Agent Geo-Simulation.
19
Non-self-overlapping Hermite interpolation mapping: a practical solution for structured quadrilateral meshing
Charlie C. L. Wang,Kai Tang +1 more
TL;DR: A constrained functional optimization scheme is adopted to adjust the tangent functions and the twist vectors, adaptive to the geometry of the boundary curves, so that the resulting HIM will be free of self-overlapping.
References
Computational geometry.
Michael Ian Shamos
- 01 Jan 1978
TL;DR: The first such result is provided by showing that greedy routing can be made to work on Planar triangulations, and some well known results in geometry are generalized to the topological plane.
3.3K
Computational Geometry
Franco P. Preparata,M. Shamos +1 more
- 01 Sep 1985
TL;DR: This book clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics and points the way to the solution of the more challenging problems in dimensions higher than two.
3.1K
Constrained Delaunay triangulations
L. P. Chew
- 01 Oct 1987
TL;DR: It is shown that the constrained Delaunay triangulation (CDT) can be built in optimal &Ogr;(n log n) time using a divide-and-conquer technique, which matches the time required to build an arbitrary (unconstrained) Delaunays and an arbitrary constrained (nonDelaunay) triangulations.
241
Delaunay-based representation of surfaces defined over arbitrarily shaped domains
TL;DR: In the paper, the problem of triangulating arbitrarily shaped domains is considered, and a new definition of Delaunay triangulation of a set of points constrained by a polygonal boundary is introduced.
146