1980
DOI: 10.1007/bf00977785
|View full text |Cite
|
Sign up to set email alerts
|

Two algorithms for constructing a Delaunay triangulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
588
0
5

Year Published

1996
1996
2017
2017

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 1,256 publications
(619 citation statements)
references
References 19 publications
0
588
0
5
Order By: Relevance
“…This choice follows what was found by Foster & Evans (2008), that demonstrated how, in the case of local maps of TEC, the natural neighbour interpolation technique gives better results with respect to other commonly used methods (linear, inverse distance weighting, kriging, etc.). Details on the natural neighbour interpolation technique applied can be found in Okabe et al (1994) and Lee & Schachter (1980).…”
Section: Tec and Tec Spatial Gradientsmentioning
confidence: 99%
“…This choice follows what was found by Foster & Evans (2008), that demonstrated how, in the case of local maps of TEC, the natural neighbour interpolation technique gives better results with respect to other commonly used methods (linear, inverse distance weighting, kriging, etc.). Details on the natural neighbour interpolation technique applied can be found in Okabe et al (1994) and Lee & Schachter (1980).…”
Section: Tec and Tec Spatial Gradientsmentioning
confidence: 99%
“…For the generation of the regular grid v(x, z), we first have to know in which triangle a particular gridpoint is located, and then to interpolate within this triangle. The efficient search of the encircling triangle is performed by the walking triangle or trifind algorithm (Lawson 1977;Lee & Schachter 1980;Sambridge et al 1995) without the need to check all triangles. The interpolation within a particular triangle is done by barycentric interpolation well known from computer graphics (e.g.…”
Section: O D E L Pa R a M E T R I Z At I O Nmentioning
confidence: 99%
“…Deformacije na površini stene smo izračunali iz razdalj med sosednimi točkami z enačbo (6). Sosednje točke smo prepoznali z Delaunayevo triangulacijo (Lee in Schachter, 1980), ki raztresene točke poveže v trikotniško nepravilno mrežo. Izračunani velikosti deformacije smo pripisali položaj sredine stranice, ki povezuje točki, iz katerih je bila deformacija izračunana.…”
Section: Opis Postopka Merjenja Deformacij Pri Preiskavah Mehanske Odunclassified