Centre de documentation
scientifique

A polyhedra-based model for moving regions in databases / Florian Heinz in International journal of geographical information science IJGIS, vol 34 n° 1 (January 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n° 1 (January 2020) . - pp 41 - 73 Titre : A polyhedra-based model for moving regions in databases Type de document : Article/Communication Auteurs : Florian Heinz, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2020 Article en page(s) : pp 41 - 73 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes IGN] base de données orientée objet [Termes IGN] CGAL [Termes IGN] implémentation (informatique) [Termes IGN] isomorphisme [Termes IGN] MADS [Termes IGN] modélisation spatio-temporelle [Termes IGN] objet mobile [Termes IGN] polyèdre Résumé : (auteur) Moving objects databases store and process objects with a focus on their spatiotemporal behaviour. To achieve this, the model of the data must be suitable to efficiently store and process moving objects. Currently, a unit-based model is widely used, where each moving object is divided into one or more time intervals, during which the object behaves uniformly. This model is also used for a data type called moving regions, which resembles moving and shape changing regions as, for example, forest fires or cloud fields. However, this model struggles to support operations like union, difference or intersection of two moving regions; the resulting objects are unnecessarily bloated and uncomfortable to handle because the resulting number of units is generally very high. In this paper, an alternative model for moving regions is proposed, which is based on polyhedra. Furthermore, this work develops an isomorphism between moving regions and polyhedra including all relevant operations, which has the additional advantage that several implementations for those are already readily available; this is demonstrated by a reference implementation using the existing and well-tested Computational Geometry Algorithms Library (CGAL). Numéro de notice : A2020-007 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2019.1616090 Date de publication en ligne : 17/05/2019 En ligne : https://doi.org/10.1080/13658816.2019.1616090 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94387 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2020011	RAB	Revue	Centre de documentation	En réserve L003	Disponible

A dimension-independent extrusion algorithm using generalised maps / Ken Arroyo Ohori in International journal of geographical information science IJGIS, vol 29 n° 7 (July 2015)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 29 n° 7 (July 2015) . - pp 1166-1186 Titre : A dimension-independent extrusion algorithm using generalised maps Type de document : Article/Communication Auteurs : Ken Arroyo Ohori, Auteur ; Hugo Ledoux, Auteur ; Jantien E. Stoter, Auteur Année de publication : 2015 Article en page(s) : pp 1166-1186 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] C++ [Termes IGN] CGAL [Termes IGN] données multidimensionnelles [Termes IGN] traitement de données localisées Résumé : (Auteur) One solution to the integration of additional characteristics, for example, time and scale, into GIS data sets is to model them as extra geometric dimensions perpendicular to the spatial ones, creating a higher-dimensional model. While this approach has been previously described and advocated, it is scarcely used in practice because of a lack of high-level construction algorithms and accompanying implementations. We present in this paper a dimension-independent extrusion algorithm permitting us to construct from any (n–1)-dimensional linear cell complex represented as a generalised map, an n-dimensional one by assigning to each (n–1)-cell one or more intervals where it exists along the nth dimension. We have implemented the algorithm in C++11 using CGAL, made the source code publicly available and tested it in experiments using real-world 2D GIS data sets which were extruded to construct up to 5D models. Numéro de notice : A2015-602 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1010535 En ligne : https://doi.org/10.1080/13658816.2015.1010535 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=78016 [article]