A storage-efficient method for construction of a Thiessen triangulation (Q1060525): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Gerald Farin / rank | |||
Property / reviewed by | |||
Property / reviewed by: Gerald Farin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1216/rmj-1984-14-1-119 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2142619821 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:14, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A storage-efficient method for construction of a Thiessen triangulation |
scientific article |
Statements
A storage-efficient method for construction of a Thiessen triangulation (English)
0 references
1984
0 references
The paper addresses the problem of triangulating a set of two-dimensional data points. Among the many possible triangulations, the one arising from the Thiessen (or Voroni or Dirichlet) tesselation of the data points has several desirable properties. The described method does not construct the Thiessen tesselation but builds the triangulation by optimizing an initial triangulation (swapping of diagonals). A presorting of the data points is carried out which, in connection with the described data structure, proves to be time efficient. The algorithm and the used data structure are then compared to other methods.
0 references
Thiessen tesselation
0 references
data structures
0 references
triangulating
0 references
Voroni
0 references
presorting
0 references