2005
DOI: 10.1559/152304005775194791
|View full text |Cite
|
Sign up to set email alerts
|

Towards a 3D Feature Overlay through a Tetrahedral Mesh Data Structure

Abstract: ABSTRACT:The use of 3D features within GIS has been increasing due to the need to represent, query, manipulate, and analyze man-made objects in relationship to other 3D features related to the surface of the earth. This will yield an increased use of 3D boundary representations of the features. The spatial relationship between two or more features is often evaluated using a geometrical overlay of these features, which reveals whether these features overlap and-if they do-to which extent. We present the design … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2006
2006
2011
2011

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Simplexes offer not only support for calculations, but also for more complex spatial operations like buffer (de Vries 2001) and overlay (van der Most 2004). Verbree et al (2005) describe the possibilities of executing these classic GIS operators on tetrahedrons. Validation is another operation that can be performed on both simplexes and features.…”
Section: Definitionmentioning
confidence: 99%
“…Simplexes offer not only support for calculations, but also for more complex spatial operations like buffer (de Vries 2001) and overlay (van der Most 2004). Verbree et al (2005) describe the possibilities of executing these classic GIS operators on tetrahedrons. Validation is another operation that can be performed on both simplexes and features.…”
Section: Definitionmentioning
confidence: 99%
“…While there has been some work by previous researchers on cutting tetrahedral meshes by a plane 10–12, it has been primarily for the purpose of visualization. To the best of our knowledge, this is the first time this problem—subdividing polyhedral meshes along a set of disjoint planes and creating a conformal mesh for the purpose of solving PDEs, and particularly in parallel—has been addressed in the literature.…”
Section: Introductionmentioning
confidence: 99%
“…[12,13] The inclusion test is not a complex problem, but a robust, correct and efficient algorithm is needed because the basic test has to be applied many times in the geometric intersection test that should be performed within reasonable computational time. [14,15] Moreover, the point inclusion test lays the foundation of other geometric computation for complex 3D models, e.g., geometric intersection for general polyhedra.…”
Section: Introductionmentioning
confidence: 99%