Détail de l'auteur
Auteur F. Penninga
Documents disponibles écrits par cet auteur
Ajouter le résultat dans votre panier Affiner la recherche Interroger des sources externes
A simplicial complex-based DBMS approach to 3D topographic data modelling / F. Penninga in International journal of geographical information science IJGIS, vol 22 n° 6-7 (june 2008)
Titre : A simplicial complex-based DBMS approach to 3D topographic data modelling Type de document : Article/Communication Auteurs : F. Penninga, Auteur ; Peter J. M. Van Oosterom, Auteur Année de publication : 2008 Article en page(s) : pp 751 - 779 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] base de données topographiques
[Termes IGN] données localisées 3D
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] reconstruction 3D du bâti
[Termes IGN] SIG 3D
[Termes IGN] simplification de contour
[Termes IGN] système de gestion de base de données
[Termes IGN] TETRAEDRE
Résumé : (Auteur) This paper introduces a new compact topological 3D data structure. The proposed method models the real world as a complete decomposition of space and this subdivision is represented by a constrained tetrahedral network (TEN). Operators and definitions from the mathematical field of simplicial homology are used to define and handle this TEN structure. Only tetrahedrons need to be stored explicitly in a (single column) database table, while all simplexes of lower dimensions, constraints and topological relationships can be derived in views. As a result the data structure is relatively compact and easy to update, while it still offers favourable characteristics from a computational point of view as well as presence of topological relationships. Copyright Taylor & Francis Numéro de notice : A2008-231 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article Permalink :
in International journal of geographical information science IJGIS > vol 22 n° 6-7 (june 2008) . - pp 751 - 779[article]
RéservationRéserver ce document
Code-barres Cote Support Localisation Section Disponibilité 079-08041 RAB Revue Centre de documentation En réserve 3L Disponible 079-08042 RAB Revue Centre de documentation En réserve 3L Disponible3D topography / F. Penninga (2008)
Titre : 3D topography : a simplicial complex-based solution in a spatial DBMS Type de document : Monographie Auteurs : F. Penninga, Auteur Editeur : Delft : Netherlands Geodetic Commission NGC Année de publication : 2008 Collection : Netherlands Geodetic Commission Publications on Geodesy, ISSN 0165-1706 num. 66 Importance : 192 p. Format : 17 x 24 cm ISBN/ISSN/EAN : 978-90-6132-304-4 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] algorithme du simplexe
[Termes IGN] base de données localisées 3D
[Termes IGN] données localisées 3D
[Termes IGN] milieu urbain
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] objet géographique 3D
[Termes IGN] système de gestion de base de données
[Termes IGN] TETRAEDRE
[Termes IGN] Triangulated Irregular Network
[Termes IGN] visualisation 3D
Résumé : (Auteur) Current topographic products are limited to a real world representation in only two dimensions, with at best some additional point heights and contour lines. Modelling the real world in two dimensions implies a rather drastic simplification of three di-mensional real world elements. By representing these elements in two dimensions, loss of information is inevitable. Due to this simplification, accuracy of analysis results is limited and a meaningful, insightful representation of complex situations is hard to obtain. Environmental issues like high concentrations of particulate matter along highways in urban areas, the effects of noise and odour propagation and risk analysis of liquefied petroleum gas storage tanks are random examples of current issues in 3D urban planning in which more precision is required than 2D analyses can offer. In a time with increasing attention for these kind of environmental and sustainability issues, limitations of 2D models become real problematic and trigger the demand for 3D topography.
The development of 3D topography is also supply-driven, especially by the increasing availability of high density laser scan data. Height data becomes available with point densities -multiple height points per square meter- that were previously unthinkable with traditional photogrammetric stereo techniques. Direct 3D data ac-quisition by terrestrial laser scanning is emerging, thus providing detailed measure-ments of facades, tunnels and even indoor topography. The fast developments in this field are partly triggered by the emerging popularity of personal navigation devices, which will use 3D models in the future to simplify user interpretation of the (map) display.
Objective and research question
The objective of this research is to develop a data structure that is capable of han-dling large data volumes and offers support for loading, updating, querying, analysis and especially validation. To achieve this, a triangular approach will be used, due to its advantages in maintaining consistency, its robustness and editability. This tri-angular approach creates a network of triangles (in 2D) or tetrahedrons (in 3D), in which topographic features are represented by sets of triangles or tetrahedrons. Such a network is an example of an irregular tessellation, in which the real world is de--composed into smaller (triangle/tetrahedron-shaped) building blocks. The resulting networks are called TINs (Triangular Irregular Networks) or TENs (TEtrahedronised irregular Networks). The presence of boundaries of topographic features are ensured by the use of constraints, preventing the deletion of crucial boundary edges and trian-gles. Algorithms exist to calculate these constrained triangulations and constrained tetrahedronisations of topographic data.
In this research a two-step approach will be adopted. First one has to decide how real-world objects should be modelled into features, secondly one needs to store these features in such a way that the requirements in terms of querying, analysis and validation are met. An obvious step in dealing with large volumes of geographically referenced data, is to use a spatial database.
This objective is expressed in the main research question:
How can a 3D topographic representation be realised in a feature-based triangular data model?
Note that the term 'triangular' is used here in general dimension, so both triangle-and tetrahedron-based models will be considered. As mentioned before, a two-step approach will be adopted to achieve a solution to the main research question. In accordance with the two steps, two key questions can be distinguished:
How to develop a conceptual model that describes the real world phenomena (the topographic features), regarding the general purpose-characteristic of to-pographic data sets?
How to implement this conceptual model, i.e. how to develop a suitable DBMS data structure?
The results of this research will be summarised according to this two-step approach.
A conceptual data model for 3D topography
One of the basic assumptions within this research is the use of triangular data models. As a result, topographic features will be described as sets of triangles and these fea-tures will be connected by triangles as well, thus creating one triangular network. This research explored two different approaches to triangular modelling of 3D topography.
The first one is a very pragmatic hybrid approach that combines a 2.5D* sur-face with 3D objects for those cases where 2.5D modelling is not sufficient. In terms of triangular data structures, this approach combines a TIN with several TENs. These irregular data structures not only allow varying point density (de-pending on local model complexity), but extend this irregularity into varying even model dimensionality, thus offering the ultimate fit-for-purpose approach. Unfortunately, connecting TIN and TEN networks appeared to be very difficult at design level and during prototype implementation.
The second approach avoids these problems, since it is a full 3D approach using only a TEN. Two fundamental observations are of great importance:
Physical objects have by definition a volume. In reality, there are no point, line or polygon objects; only point, line or polygon representations exist (at a certain level of abstraction/generalisation).
The real world can be considered a volume partition: a set of nonoverlap-ping volumes that form a closed (i.e. no gaps within the domain) modelled space. Objects like 'earth' or 'air' are thus explicitly included in the model.
In topographic data models, planar features like walls or roofs are obviously very useful. They can be part of the volumetric data model as 'derived features', i.e. these features depend on the relationship between volume features. For example, the earth surface is the boundary between air and earth features, while a wall or a roof are the result of adjacent building and air features. In terms of UML, these planar features are modelled as association classes. As a result, planar features are lifetime dependent from the association between two volume features.
Among the advantages of the full volumetric approach are its explicit inclusion of air and earth (often subject of analysis), its extensibility (geology, air traf-fic/telecommunication corridors, etc.) and its strong mathematical definition (full connectivity enables the use of topology for query, analysis and validation). As a re-sult, topographic features will be modelled in a TEN. Each feature will be represented by a set of tetrahedrons.
A data structure for 3D topography
The newly developed data structure has three important characteristics:
It has a solid mathematical foundation. Operators and definitions from the mathematical field of Poincare simplicial homology (part of algebraic topology) are used to handle simplexes^, the basic elements in a triangular data structure. Simplexes are well defined, ordered and constructed of simplexes of lower di-mension. The boundary operator can be used to derive these less dimensional
*See section 2.2 for an overview of often-used dimension indicators
tA simplex can loosely be defined as the simplest shape in a dimension, in which simplest refers to minimising the number of points required to define such a shape, for instance a point, a line, a triangle and a tetrahedron. See section 4.1 for a proper mathematical definition simplexes. Based on the ordering of simplexes, one can determine orientation, a useful concept in GIS. Another important concept from simplicial homology is the simplicial complex, since such a set of connected simplexes will be used to model 3D topographic features.
It is developed as a spatial database data structure. Applying definitions and operators from simplicial homology enables one to store a TEN in a relatively compact way. The new simplicial complex-based method requires only explicit storage of tetrahedrons, while simplexes of lower dimensions (triangles, edges, nodes), constraints (which guarantee feature boundary presence) and topologi-cal relationships can be derived in views. Using functions to derive views from a table is typical database functionality. In this implementation, simplexes are en-coded by their vertices, similar to the annotation in simplicial homology. These simplex encodings are extended with a feature identifier, indicating which to-pographic feature is (partly) represented by this simplex. So, a tetrahedron is encoded as 83 =< vq, Vi, V2,v^, fid >. Two variants in simplex encoding have been developed: coordinate concatenation and identifier concatenation. The concept of coordinate concatenation is to concatenate x, y and z coordinates as node identifiers and to concatenate the resulting unique node codes to describe simplexes of higher dimension. The alternative approach, identifier concatena-tion, uses separate (meaningless) node identifiers to encode simplexes to reduce the number of coordinate repetitions, since a specific node will be part of multi-ple tetrahedrons. This approach requires an additional node table to store node geometries.
It is an editable data structure, which is a crucial prerequisite to be a feasible approach for topographic data storage. Incremental updates are required, since complete rebuilds of the TEN structure will be time-consuming due to the ex-pected data volumes. Whereas most existing update algorithms for constrained tetrahedronisations use node insertions, followed by edge reconstruction, this research presents edge insertion operators. Nine exhaustive and mutually exclusive cases are distinguished, based on the location in the TEN of the inserted edge's nodes. These operators guarantee the constrained edge's presence in the structure. Existing operators might fail to recover these edges, due to the pres-ence of nearby constrained edges, which would typically happen in topographic data sets.
This dissertation presents a new topological approach to data modelling, based on a tetrahedral network. Operators and definitions from the field of simplicial homology are used to define and handle this structure of tetrahedrons. Simplicial homology provides a solid mathematical foundation for the data structure and offers full control over orientation of simplexes and enables one to derive substantial parts of the TEN structure efficiently, instead of explicitly storing all primitives. DBMS characteristics as the usage of views, functions and function-based indexes are extensively used to realise this potential data reduction. A proof-of-concept implementation was created and tests with several data sets show that the prevailing view that tetrahedrons are more expensive in terms of storage when compared to polyhedrons, is not correct when using the proposed approach. Storage requirements for 3D objects in tetrahe-dronised form (excluding the space in between these objects) and 3D objects stored as polyhedrons, are in the same order of magnitude.
A TEN has favourable characteristics from a computational point of view. All elements of the tetrahedral network consist by definition of flat faces, all elements are convex and they are well defined. Validation of 3D objects is also simplified by tetrahedronisation. Furthermore, a full volumetric approach enables future integra-tion of topography with other 3D data like geological layers, polluted regions or air traffic and telecommunication corridors. The price of this full volumetric approach in terms of storage space is high (about 75% of the tetrahedrons models air or earth); nevertheless this approach is likely to become justifiable due to current developments towards sustainable urban development and increased focus on environmental issues.
Now the innovative aspects of the proposed method has to be identified. Neither the idea to use a TEN data structure for 3D data nor the idea to use simplexes (in terms of simplicial homology) in a DBMS implementation is new. However, the proposed approach reduces data storage and eliminates the need for explicit updates of both topology and simplexes of lower dimension. By doing so, the approach tackles common drawbacks as TEN extensiveness and laboriousness of maintaining topology. Furthermore, applying simplicial homology offers full control over orientation of sim-plexes, which is a significant advantage, especially in 3D. In addition to this aspect, the mathematical theory of simplicial homology offers a solid theoretical foundation for both the data structure and data operations. Integrating these concepts with database functionality results in a new innovative approach to 3D data modelling.
An often raised objection to a TEN approach is its presumed complexity. Obviously, a l:n relation exists between features and their tetrahedron representations. However, as long as a user handles only features (as polyhedrons) and implemented algorithms translate these polyhedrons into operations on the TEN, one can over-come the perceived complexity. Furthermore, the prevailing view that tetrahedrons are more expensive in terms of storage than polyhedrons has been falsified in this research.
Overall, the simplicial complex-based modelling approach provides a provable correct modelling method. The use of tetrahedrons is justified by the mathematical benefits and the acceptable storage requirements. Obviously, including air and earth within the model comes at a price, but -as stated earlier- this approach is likely to become justifiable, due to current sustainability and environmentally-driven developments. The decision to develop the data structure as a database structure contributes to the overall feasibility, since a database will become indispensable due to the expected data volumes.
Note de contenu : Acknowledgements
1.2 Objective and main research question
1.3 Research scope and limitations
1.4 Contribution of the work
2 Research background
2.1 Problem domain: Towards 3D topography
2.2 Defining dimensions in the range 2D-3D
2.3 Deriving requirements for the conceptual data model and structure from the problem
2.4 Managing 3D data: related research on 3D data structures
2.5 Triangular data structures and algorithms
2.6 Relevant database concepts
I Conceptual modelling of 3D Topography
3 Two triangular data models for 3D topography
3.1 Approach 1: an integrated 2.5D/3D model
3.2 Approach 2: a full 3D data model
3.3 The choice for the full 3D approach
II A Data structure for 3D Topography
4 Theoretical foundations: Poincare simplicial homology
4.1 Mathematical description of simplexes
4.2 Orientation of simplexes
4.3 Combining simplexes: simplicial complexes
4.4 Operations on simplexes and simplicial complexes
5 A simplicial complex-based solution for 3D topography
5.1 Representing topographic features in a TEN
5.2 Early ideas: three TEN-based data structures for the full 3D approach
5.3 Preferred solution: applying simplicial homology to the TEN
5.4 Implementing the data structure in a DBMS environment
6 Updating features in the Data Structure
6.1 Incremental update: feature insertion
6.2 Incremental update: feature deletion
6.3 Quality improvement of TEN structure
6.4 Initial bulk loading and bulk rebuild
III Evaluation and conclusions
7 Evaluation and discussion
7.1 Evaluation material: three different data sets
7.2 Evaluating bulk tetrahedronisation process
7.3 Evaluating storage requirements
7.4 Evaluating initial visualisation tools
7.5 Discussing requirements for 3D data sets with correct topology
7.6 Identifying future developments
8.2 Main conclusions
8.4 Future research
Numéro de notice : 15361 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Monographie Permalink :
RéservationRéserver ce document
Code-barres Cote Support Localisation Section Disponibilité 15361-01 32.00 Livre Centre de documentation Topographie Disponible 15361-02 32.00 Livre Centre de documentation Topographie DisponibleConstruction of the planar partition postal code map based on cadastral registration / F. Penninga in Geoinformatica, vol 9 n° 2 (June - August 2005)
Titre : Construction of the planar partition postal code map based on cadastral registration Type de document : Article/Communication Auteurs : F. Penninga, Auteur ; E. Verbee, Auteur ; et al., Auteur Année de publication : 2005 Article en page(s) : pp 181 - 204 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique
[Termes IGN] cadastre étranger
[Termes IGN] cadastre numérique
[Termes IGN] code postal
[Termes IGN] diagramme de Voronoï
[Termes IGN] géocodage par adresse postale
[Termes IGN] Pays-Bas
[Termes IGN] squelettisation
[Termes IGN] World Geodetic System 1984
Résumé : (Auteur) Accurate postal code maps have many applications within GIS as the postal code has the potential to link the address description of buildings to their location in a specified global reference system in a more natural way. This relationship is possible in both directions: geocoding and reverse-geocoding. These operators demand a mechanism for translating an exact geometric position (i.e., WGS84 coordinate) into a location indication (town, street, house number) and vice versa. As most built-up parcels are provided with a postal code, this indicator can be used as the linkage. This paper describes the procedure, based on the Dutch cadastral registration, to obtain a reliable 6-position (i.e., 262813X, the highest level of detail possible) planar postal code map for the Netherlands. Problems with existing, Voronoi-diagram based, postal code maps, like intersected houses and arbitrary derived (and thus unrecognizable) boundaries are avoided. The reliability of the derived planar postal code map is discussed and results are illustrated by figures. For a planar coverage, non built-up parcels having no postal code should be assigned a plausible postal code. Furthermore special attention is given to infrastructural parcels. These parcels are divided at their (approximated) skeletons first and then these subdivided infrastructure parcels are piecewise attached to their neighbour parcels. This new approach results in very reliable postal code maps, which are visually attractive too as infrastructure lines can be recognized. The procedure is generic and can be applied to other administrative parcel information as well. The algorithm is implemented using the Computational Geometry Algorithms Library (CGAL), and the possibilities and limitations of this library are addressed as well. Also a number of non-implemented alternatives or improvements are given. Numéro de notice : A2005-226 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article Permalink :
in Geoinformatica > vol 9 n° 2 (June - August 2005) . - pp 181 - 204[article]
RéservationRéserver ce document
Code-barres Cote Support Localisation Section Disponibilité 057-05021 RAB Revue Centre de documentation En réserve 3L Disponible