2019
DOI: 10.1007/978-3-030-13992-6_12
|View full text |Cite
|
Sign up to set email alerts
|

Tuned Terminal Triangles Centroid Delaunay Algorithm for Quality Triangulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Figure 2a shows the scan path-i.e., the scan points from which the imaging data are received. The triangulation of the scan points based on the Delaunay algorithm [33] is presented in Figure 2b. The image can be obtained by filling every triangle with the average pixel value of its three vertexes.…”
Section: Imaging Principle Of Thz Rotation Mirror Imaging Systemmentioning
confidence: 99%
“…Figure 2a shows the scan path-i.e., the scan points from which the imaging data are received. The triangulation of the scan points based on the Delaunay algorithm [33] is presented in Figure 2b. The image can be obtained by filling every triangle with the average pixel value of its three vertexes.…”
Section: Imaging Principle Of Thz Rotation Mirror Imaging Systemmentioning
confidence: 99%
“…The algorithms above place Steiner vertices at the circumcenter of a poor-quality tetrahedron. Instead, one can also place them at off-center points such that they are sufficiently far away from other vertices in the mesh.Üngör et al [14,20,45,46], Chernikov and Chrisochoides [5,6,15], Rivara et al [27,28,29], Hudson [17,18], and Engwirda [12,13] developed heuristic algorithms that place Steiner vertices at off-center points. They have shown that their algorithms provide quality guarantees that are as good as the algorithms above.…”
Section: Introductionmentioning
confidence: 99%