2008
DOI: 10.1080/13658810701517120
|View full text |Cite
|
Sign up to set email alerts
|

Modelling three‐dimensional geoscientific fields with the Voronoi diagram and its dual

Abstract: Fields as found in the geosciences have properties that are not usually found in other disciplines: the phenomena studied are often three-dimensional, they tend to change continuously over time, and the collection of samples to study the phenomena is problematic, which often results in highly anisotropic distributions of samples. In the GIS community, raster structures (voxels or octrees) are the most popular solutions, but, as we show in this paper, they have shortcomings for modelling and analysing 3D geosci… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
47
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 48 publications
(47 citation statements)
references
References 50 publications
0
47
0
Order By: Relevance
“…Then, every topological event which is the distance required for the moving point to cut the first circle on its trajectory is computed. Ledoux (2006) extended this algorithm to 3D for managing one moving point in 3D tessellation. However, there is a large number of moving points and topological events in a deforming kinetic spatial tessellation which must be managed in order to preserve the validity of the 3D tessellation.…”
Section: Free-lagrangian Methods and Voronoi Tessellationmentioning
confidence: 99%
“…Then, every topological event which is the distance required for the moving point to cut the first circle on its trajectory is computed. Ledoux (2006) extended this algorithm to 3D for managing one moving point in 3D tessellation. However, there is a large number of moving points and topological events in a deforming kinetic spatial tessellation which must be managed in order to preserve the validity of the 3D tessellation.…”
Section: Free-lagrangian Methods and Voronoi Tessellationmentioning
confidence: 99%
“…Best alternative seems to be a classic walking algorithm [24]. As noted in [25], Mücke shows [26] that careful use of walking algorithm can bring down expected time close to O(n 1/4 ) (for d = 3).…”
Section: Interpolation Of a Vector Fieldmentioning
confidence: 99%
“…The main purpose of defining the data structure in the data model is to enable any process of analyzing the world with its objects and phenomena within the digital model (Boguslawski, 2011). Different data structures can be implemented in a single data model (Ledoux, 2006).…”
Section: Data Structurementioning
confidence: 99%