2002
DOI: 10.1016/s0925-7721(01)00047-5
|View full text |Cite
|
Sign up to set email alerts
|

Delaunay refinement algorithms for triangular mesh generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
597
0
19

Year Published

2011
2011
2016
2016

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 990 publications
(617 citation statements)
references
References 15 publications
1
597
0
19
Order By: Relevance
“…TRIANGLE: Two-Dimensional Quality Mesh Generator and Delaunay Triangulator [Shewchuk, 1996[Shewchuk, , 2001]. This package is used for creating unstructured isotropic twodimensional triangular meshes.…”
Section: Discussionmentioning
confidence: 99%
“…TRIANGLE: Two-Dimensional Quality Mesh Generator and Delaunay Triangulator [Shewchuk, 1996[Shewchuk, , 2001]. This package is used for creating unstructured isotropic twodimensional triangular meshes.…”
Section: Discussionmentioning
confidence: 99%
“…The proposed method was implemented in C language, OpenCV library support, OpenGL library support, and Triangle [10] program for applying the constrained Delaunay Triangulation during mesh generation. Size of the images used is 640 × 480.…”
Section: Resultsmentioning
confidence: 99%
“…For these species, we propose an alternative method for computing neutral bending axes by meshing the crosssection with internal points of a regular spacing. The mesh can then be used to compute a Delaunay triangulation for the combined internal and external section points (Shewchuk 2002). Each element in the mesh is assigned a weighted E based on its distance from the section centroid, or alternatively, the distance to the closest exterior point of the section.…”
Section: Methodological Solution To Determine Sensor Placementmentioning
confidence: 99%