Détail de l'auteur
Auteur Ralf Hartmut Güting |
Documents disponibles écrits par cet auteur (14)
Ajouter le résultat dans votre panier Affiner la recherche Interroger des sources externesA polyhedra-based model for moving regions in databases / Florian Heinz in International journal of geographical information science IJGIS, vol 34 n° 1 (January 2020)
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èdreRé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
in International journal of geographical information science IJGIS > vol 34 n° 1 (January 2020) . - pp 41 - 73[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2020011 RAB Revue Centre de documentation En réserve L003 Disponible
Titre : A data model for moving regions of fixed shape in databases Type de document : Article/Communication Auteurs : Florian Heinz, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2018 Article en page(s) : pp 1737 - 1769 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG
[Termes IGN] iceberg
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] modélisation spatio-temporelle
[Termes IGN] objet mobile
[Termes IGN] rotation d'objet
[Termes IGN] système de gestion de base de donnéesRésumé : (Auteur) Moving object databases are designed to store and process spatial and temporal object data. An especially useful moving object type is a moving region, which consists of one or more moving polygons suitable for modeling the spread of forest fires, the movement of clouds, spread of diseases and many other real-world phenomena. Previous implementations usually allow a changing shape of the region during the movement; however, the necessary restrictions on this model result in an inaccurate interpolation of rotating objects. In this paper, we present an alternative approach for moving and rotating regions of fixed shape, called Fixed Moving Regions, which provide a significantly better model for a wide range of applications like modeling the movement of oil tankers, icebergs and other rigid structures. Furthermore, we describe and implement several useful operations on this new object type to enable a database system to solve many real-world problems, as for example collision tests, projections and intersections, much more accurate than with other models. Based on this research, we also implemented a library for easy integration into moving objects database systems, as for example the DBMS Secondo (1) (2) developed at the FernUniversität in Hagen. Numéro de notice : A2018-303 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2018.1458103 Date de publication en ligne : 04/05/2018 En ligne : https://doi.org/10.1080/13658816.2018.1458103 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90446
in International journal of geographical information science IJGIS > vol 32 n° 9-10 (September - October 2018) . - pp 1737 - 1769[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018051 RAB Revue Centre de documentation En réserve L003 Disponible
Titre : Index-supported pattern matching on tuples of time-dependent values Type de document : Article/Communication Auteurs : Fabio Valdés, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2017 Article en page(s) : pp 429 - 458 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] appariement de données localisées
[Termes IGN] appariement de modèles conceptuels de données
[Termes IGN] attribut sémantique
[Termes IGN] base de données orientée objet
[Termes IGN] données géologiques
[Termes IGN] données maillées
[Termes IGN] données spatiotemporelles
[Termes IGN] index spatial
[Termes IGN] objet mobile
[Termes IGN] reconstruction d'itinéraire ou de trajectoire
[Termes IGN] Rome
[Termes IGN] trace GPS
[Termes IGN] traitement de données localisées
[Termes IGN] transport routierRésumé : (Auteur) Lately, the amount of mobility data recorded by GPS-enabled (and other) devices has increased drastically, entailing the necessity of efficient processing and analysis methods. In many cases, not only the geographic position, but also additional time-dependent information are traced and/or generated, according to the purpose of the evaluation. For example, in the field of animal behavior research, besides the position of the monitored animal, biologists are interested in further data like the altitude or the temperature at every measuring point. Other application domains comprise the names of streets, places of interest, or transportation modes that can be recorded along with the geographic position of a person. In this paper, we present in detail a framework for analyzing datasets with arbitrarily many time-dependent attributes. This can be considered as a major extension of our previous work, a comprehensive framework for pattern matching on symbolic trajectories with index support. For an efficient processing of different data types, a variable number of indexes of four different types that correspond to the data types of the attributes are applied. We demonstrate the expressiveness and efficiency of our approach by querying a real dataset representing taxi trips in Rome and, particularly, with a broad series of experiments using trajectories generated by BerlinMOD combined with geological raster data. Numéro de notice : A2017-377 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-016-0286-6 En ligne : https://doi.org/10.1007/s10707-016-0286-6 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=85809
in Geoinformatica > vol 21 n° 3 (July - September 2017) . - pp 429 - 458[article]
Titre : Robust high-quality interpolation of regions to moving regions Type de document : Article/Communication Auteurs : Florian Heinz, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2016 Article en page(s) : pp 385 – 413 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] analyse spatio-temporelle
[Termes IGN] base de données orientée objet
[Termes IGN] données spatiotemporelles
[Termes IGN] implémentation (informatique)
[Termes IGN] interpolation linéaire
[Termes IGN] méthode robuste
[Termes IGN] objet mobile
[Termes IGN] représentation du changementRésumé : (auteur) With the rise of moving object databases it is possible to store and process spatial and temporal data, for example geometrical structures together with the information about how these behave over intervals of time. For simple objects like moving points the spatiotemporal development is derived from the start and end position in space and time, which is then linearly interpolated. For moving regions, especially with changing shapes, it is more challenging to obtain the necessary data to represent them. An elegant and intuitive solution is to create an algorithm, which automatically interpolates the moving region from the start and end shape over a specified time interval. Two papers on this topic have been published in the past, each focussing on different aspects of this so-called Region Interpolation Problem. This paper tries to combine the advantages and improve these approaches to provide high-quality interpolations while maintaining robustness even in border cases. This results in the implementation of a library, which can be easily integrated into existing moving objects database systems, as for example the DBMS Secondo developed at the FernUniversität in Hagen. Numéro de notice : A2016-376 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-015-0240-z Date de publication en ligne : 12/11/2015 En ligne : https://doi.org/https://doi.org/10.1007/s10707-015-0240-z Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81143
in Geoinformatica > vol 20 n° 3 (July - September 2016) . - pp 385 – 413[article]
Titre : Querying visible points in large obstructed space Type de document : Article/Communication Auteurs : Jianqiu Xu, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2015 Article en page(s) : pp 435 - 461 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 localisées
[Termes IGN] géomètrie algorithmique
[Termes IGN] noeud
[Termes IGN] performance
[Termes IGN] point d'intérêt
[Termes IGN] structure de données localisées
[Termes IGN] traitement automatique de données
[Termes IGN] traitement de données localisées
[Termes IGN] triangulation (topologie)Résumé : (auteur) Querying visible points is a fundamental problem in computational geometry and spatial databases. With the development of new applications such as trip planning and nearest neighbors, querying visible points plays a key role in obstacle space and the result can be further used such as defining the shortest path. Thereby, efficiently finding the result is essentially important. However, the performance of current methods decrease substantially for large datasets. To solve the problem, we proposes a new and fast algorithm to find visible points for an arbitrary query location inside a large polygon containing obstacles. The method is based on polygon triangulation. By decomposing the polygon into a set of triangles, we manage the polygon by organizing triangles in an efficient way instead of maintaining a large number of vertices. We propose a data structure to partition the searching space into several parts, each of which is independently processed. Afterwards, by recursively calling a method we search visible points by accessing triangles and return the result in a progressive way. Through a theoretical analysis, assuming the polygon contains N vertices in total, the time complexity of our algorithm is O(N), improving the existing method O(N l o g N). We prove the correctness of the algorithm and analyze the space complexity, which is O(N). The technique is extended to return visible points less than a threshold distance to the query location. Using both synthetic and real datasets, we perform extensive experiments to test our algorithm and demonstrate its efficiency and effectiveness. Visible points are efficiently processed in a large obstacle space with over one million vertices. Experimental results show that our technique gains more than one order of magnitude speedup compared to competitive methods using large datasets. Numéro de notice : A2015-495 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-014-0213-7 Date de publication en ligne : 15/08/2014 En ligne : https://doi.org/10.1007/s10707-014-0213-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=77307
in Geoinformatica > vol 19 n° 3 (July - September 2015) . - pp 435 - 461[article]Advances in spatial data bases, SSD '99, 6th International Symposium, Hong Kong, China, July 20-23, 1999 / Ralf Hartmut Güting (1999)
Permalink
