Descripteur
Termes IGN > mathématiques > analyse mathématique > topologie > triangulation (topologie) > Triangulated Irregular Network
Triangulated Irregular NetworkSynonyme(s)TIN ;réseau triangulé irrégulier Maillage triangulé irrégulier |
Documents disponibles dans cette catégorie (89)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Oracle 11G and Oracle spatial 11G / O. Ertac in Geoinformatics, vol 11 n° 5 (01/07/2008)
[article]
Titre : Oracle 11G and Oracle spatial 11G Type de document : Article/Communication Auteurs : O. Ertac, Auteur Année de publication : 2008 Article en page(s) : pp 28 - 31 Langues : Français (fre) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] données localisées 3D
[Termes IGN] fonctionnalité
[Termes IGN] Oracle
[Termes IGN] Oracle spatial
[Termes IGN] service web géographique
[Termes IGN] Triangulated Irregular NetworkRésumé : (Auteur) We first met Oracle Spatial more than ten years ago. The latest version, Oracle Spatial 11g, includes native support in Oracle Database 11g for all geospatial data types and models, including vector and raster data and topology and network models, meeting the needs of advanced geospatial systems. This article highlights Oracle Spatial features in 11g. Copyright GEOinformatics Numéro de notice : A2008-293 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29286
in Geoinformatics > vol 11 n° 5 (01/07/2008) . - pp 28 - 31[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 262-08051 SL Revue Centre de documentation Revues en salle Disponible Approximating the visible region of a point on a terrain / B. Ben-Moshe in Geoinformatica, vol 12 n° 1 (March - May 2008)
[article]
Titre : Approximating the visible region of a point on a terrain Type de document : Article/Communication Auteurs : B. Ben-Moshe, Auteur ; P. Carmi, Auteur ; M.J. Katz, Auteur Année de publication : 2008 Article en page(s) : pp 21 - 36 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] approximation
[Termes IGN] interpolation
[Termes IGN] Triangulated Irregular Network
[Termes IGN] visibilitéRésumé : (Auteur) Given a terrain and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation of Rp. The algorithm interpolates the visible region between two consecutive rays (emanating from p) whenever the rays are close enough; that is, whenever the difference between the sets of visible segments along the cross sections in the directions specified by the rays is below some threshold. Thus the density of the sampling by rays is sensitive to the shape of the visible region. We suggest a specific way to measure the resemblance (difference) and to interpolate the visible region between two consecutive rays. We also present an alternative algorithm, which uses circles of increasing radii centered at p instead of rays emanating from p. Both algorithms compute a representation of the (approximated) visible region that is especially suitable for is-visible-from-p queries, i.e., given a query point q on the terrain determine whether q is visible from p. Finally, we report on the experiments that we performed with these algorithms and with their corresponding fixed versions, using a natural error measure. Our main conclusion is that the radar-like algorithm is significantly better than the others. Copyright Springer Numéro de notice : A2008-068 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-006-0017-5 En ligne : https://doi.org/10.1007/s10707-006-0017-5 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29063
in Geoinformatica > vol 12 n° 1 (March - May 2008) . - pp 21 - 36[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-08011 RAB Revue Centre de documentation En réserve L003 Disponible
Titre : 3D topography : a simplicial complex-based solution in a spatial DBMS Type de document : Thèse/HDR 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] tétraèdre
[Termes IGN] Triangulated Irregular Network
[Termes IGN] visualisation 3DIndex. décimale : 32.00 Topographie - généralités 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.
Conclusions
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 Introduction
1.1 Motivation
1.2 Objective and main research question
1.3 Research scope and limitations
1.4 Contribution of the work
1.5 Outline
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
5.5 Summary
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 Conclusions
8.1 Results.
8.2 Main conclusions
8.3 Discussion
8.4 Future researchNuméro de notice : 15361 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Thèse étrangère DOI : sans En ligne : https://www.ncgeo.nl/index.php/en/publicatiesgb/publications-on-geodesy/item/250 [...] Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=62703 Réservation
Réserver ce documentExemplaires(2)
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 Disponible
Titre : Apport de la caractérisation du relief pour des applications risque : Synthèse du travail effectué depuis novembre 2006 au laboratoire COGIT-IGN concernant la caractérisation du relief sur les MNT Type de document : Rapport Auteurs : Adrien Paget , Auteur Editeur : Saint-Mandé : Institut Géographique National - IGN (2008-2011) Année de publication : 2008 Importance : 189 p. Format : 21 x 30 cm Note générale : bibliographie Langues : Français (fre) Descripteur : [Vedettes matières IGN] Applications photogrammétriques
[Termes IGN] Alsace (France administrative)
[Termes IGN] caractérisation
[Termes IGN] géomorphologie
[Termes IGN] géomorphométrie
[Termes IGN] hydrologie
[Termes IGN] modèle numérique de terrain
[Termes IGN] relief
[Termes IGN] réseau hydrographique
[Termes IGN] Rhône-Alpes
[Termes IGN] risque naturel
[Termes IGN] surface topographique
[Termes IGN] système d'information géographique
[Termes IGN] théorie des graphes
[Termes IGN] Triangulated Irregular NetworkIndex. décimale : 33.60 Applications photogrammétriques - usage combiné de la photogrammétrie et de la lasergrammétrie Note de contenu : Introduction
1- La caractérisation du relief : outils et méthodes
2- L'hydrographie : troisième science comme aide à la caractérisation du relief
3- La théorie des graphes pour caractériser le relief : application à l'hydrographie
ConclusionNuméro de notice : 21997 Affiliation des auteurs : COGIT (1988-2011) Thématique : GEOMATIQUE/POSITIONNEMENT Nature : Rapport de recherche DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=92019 Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 21997-01 32.00 Livre Centre de documentation Topographie Exclu du prêt Documents numériques
peut être téléchargé
Apport de la caractérisation ... - pdf auteurAdobe Acrobat PDF An elevation of void-filling interpolation methods for SRTM data / H.I. Reuter in International journal of geographical information science IJGIS, vol 21 n° 9-10 (october 2007)
[article]
Titre : An elevation of void-filling interpolation methods for SRTM data Type de document : Article/Communication Auteurs : H.I. Reuter, Auteur ; A. Nelson, Auteur ; A. Jarvis, Auteur Année de publication : 2007 Article en page(s) : pp 983 - 1008 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image
[Termes IGN] fonction spline d'interpolation
[Termes IGN] image SRTM
[Termes IGN] interpolation
[Termes IGN] interpolation linéaire
[Termes IGN] interpolation spatiale
[Termes IGN] krigeage
[Termes IGN] MNS SRTM
[Termes IGN] modèle numérique de surface
[Termes IGN] Triangulated Irregular NetworkRésumé : (Auteur) The Digital Elevation Model that has been derived from the February 2000 Shuttle Radar Topography Mission (SRTM) has been one of the most important publicly available new spatial data sets in recent years. However, the 'finished' grade version of the data (also referred to as Version 2) still contains data voids (some 836,000 km2) - and other anomalies - that prevent immediate use in many applications. These voids can be filled using a range of interpolation algorithms in conjunction with other sources of elevation data, but there is little guidance on the most appropriate void-filling method. This paper describes: (i) a method to fill voids using a variety of interpolators, (ii) a method to determine the most appropriate void-filling algorithms using a classification of the voids based on their size and a typology of their surrounding terrain; and (iii) the classification of the most appropriate algorithm for each of the 3,339,913 voids in the SRTM data. Based on a sample of 1304 artificial but realistic voids across six terrain types and eight void size classes, we found that the choice of void-filling algorithm is dependent on both the size and terrain type of the void. Contrary to some previous findings, the best methods can be generalised as: kriging or inverse distance weighting interpolation for small and medium size voids in relatively flat low-lying areas; spline interpolation for small and medium-sized voids in high-altitude and dissected terrain; triangular irregular network or inverse distance weighting interpolation for large voids in very flat areas, and an advanced spline method (ANUDEM) for large voids in other terrains. Copyright Taylor & Francis Numéro de notice : A2007-553 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1080/13658810601169899 En ligne : https://doi.org/10.1080/13658810601169899 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28916
in International journal of geographical information science IJGIS > vol 21 n° 9-10 (october 2007) . - pp 983 - 1008[article]Réservation
Réserver ce documentExemplaires(2)
Code-barres Cote Support Localisation Section Disponibilité 079-07061 RAB Revue Centre de documentation En réserve L003 Disponible 079-07062 RAB Revue Centre de documentation En réserve L003 Disponible Multi-visibility of triangulated terrains / N. Coll in International journal of geographical information science IJGIS, vol 21 n° 9-10 (october 2007)PermalinkComputation of random errors in digital terrain models / J. Bjorke in Geoinformatica, vol 11 n° 3 (September - November 2007)PermalinkFilling the voids in the SRTM elevation model: a tin-based delta surface approach / E. Luedeling in ISPRS Journal of photogrammetry and remote sensing, vol 62 n° 4 (September 2007)PermalinkUnified hybrid terrain representation based on local convexifications / M. Bóo in Geoinformatica, vol 11 n° 3 (September - November 2007)Permalink3D Visualisation of Lidar data: state of the art and proposed system / S. Ghosh in GIM international, vol 21 n° 2 (February 2007)PermalinkSIG web-3D basé sur POSTGIS et X3D / M. Le Serre (2007)PermalinkRadial topology algorithm: a new approach for deriving 2.5D GIS data models / U. Lenk in Geoinformatica, vol 10 n° 4 (December 2006)PermalinkSemantically correct 2.5D GIS data: the integration of a DTM and topographic vector data / A. Koch in ISPRS Journal of photogrammetry and remote sensing, vol 61 n° 1 (October 2006)PermalinkError assessment in two lidar-derived TIN datasets / M.H. Peng in Photogrammetric Engineering & Remote Sensing, PERS, vol 72 n° 8 (August 2006)PermalinkUtilizing Voronoi cells of location data streams for accurate computation of aggregate functions in sensor networks / M. Sharifzadeh in Geoinformatica, vol 10 n° 1 (March - May 2006)PermalinkAn integrated TIN and Grid method for constructing multi-resolution digital terrain models / B. Yang in International journal of geographical information science IJGIS, vol 19 n° 10 (november 2005)PermalinkTime-space modelling with terrestrial Lidar: monitoring ice cliff evolution of the glacier, Italy with ILRS-3D / A. Tamburini in GIM international, vol 19 n° 11 (November 2005)PermalinkGestion des données multitemporelles de l'auscultation d'un monument historique / M. Koehl in Géomatique expert, n° 46 (01/10/2005)PermalinkSIG "paysages bocagers" : un outil pour l'étude des paysages bocagers et l'aide à la décision / Erwan Bocher in Revue internationale de géomatique, vol 15 n° 3 (septembre – novembre 2005)PermalinkDigital terrain model computation from contour lines: how to derive quality information from artifact analysis / Olivier Bonin in Geoinformatica, vol 9 n° 3 (September - November 2005)PermalinkTechnological aspects of a full 3D cadastral registration / Jantien E. Stoter in International journal of geographical information science IJGIS, vol 19 n° 6 (july 2005)PermalinkEmbedding landscape processes into triangulated terrain models / E.R. Vivoni in International journal of geographical information science IJGIS, vol 19 n° 4 (april 2005)PermalinkDelaunay triangulation structured kriging for surface interpolation / Yaron Felus in Surveying and land information science, vol 65 n° 1 (01/03/2005)PermalinkCalcul de zones isochrones / M. Le Bars (2005)PermalinkFusion de relevés optiques et acoustiques de sites archéologiques sous marins : études de cas dans l'anse des catalans, Marseille, Volume 2. Application de travail sur les grilles et modèles de points 3D, documentation utilisateur / Rémi Provin (2005)Permalink