Centre de documentation
scientifique

A probability-based uncertainty model for point-in-polygon analysis in GIS / C.K. Cheung in Geoinformatica, vol 8 n° 1 (March - May 2004)  

Public [article]  inGeoinformatica > vol 8 n° 1 (March - May 2004) . - pp 71 - 98 Titre : A probability-based uncertainty model for point-in-polygon analysis in GIS Type de document : Article/Communication Auteurs : C.K. Cheung, Auteur ; Wei Shi, Auteur ; X. Zhou, Auteur Année de publication : 2004 Article en page(s) : pp 71 - 98 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] analyse de données [Termes IGN] incertitude géométrique [Termes IGN] modèle mathématique [Termes IGN] noeud [Termes IGN] point [Termes IGN] polygone [Termes IGN] propagation d'erreur [Termes IGN] système d'information géographique Résumé : (Auteur) In a geographical information system (GIS), a conventional point-in-polygon analysis is used to determine whether a point is located inside a polygon with a Boolean result. Due to positional uncertainties existing with both the point and the polygon, the Boolean answer cannot describe the relationship of closeness between the point and the polygon. This paper aims to develop a model and to provide a continuous index - the probability value - to indicate the extent of the uncertain point located inside the uncertain polygon based upon existing research development. This probability index is derived based on probability and statistical theories considering the statistical uncertainty distributions of the point and the polygon's vertices. The associated mathematical expressions for the probability index are addressed in cases depending on the intersection between the polygon and the error ellipse of the point. The proposed probability index can provide an objective description of the relationship of closeness between an uncertain point and an uncertain polygon. Numéro de notice : A2004-013 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1023/B:GEIN.0000007725.41038.03 En ligne : https://doi.org/10.1023/B:GEIN.0000007725.41038.03 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26541 [article]

Exemplaires(1)

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

Efficient polygon amalgamation methods for spatial OLAP and spatial data mining / X. Zhou (20/07/1999)  

Public contenu dans Advances in spatial data bases, SSD '99, 6th International Symposium, Hong Kong, China, July 20-23, 1999 / Ralf Hartmut Güting (1999)   Titre : Efficient polygon amalgamation methods for spatial OLAP and spatial data mining Type de document : Article/Communication Auteurs : X. Zhou, Auteur ; D. Truffet, Auteur ; Jiawei Han, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 20/07/1999 Conférence : SSD 1999, 6th International Symposium Advances in spatial data bases 20/07/1999 23/07/1999 Hong Kong Chine Proceedings Springer Importance : pp 167 - 187 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] exploration de données géographiques [Termes IGN] indexation spatiale [Termes IGN] OLAP [Termes IGN] polygone [Termes IGN] regroupement de données [Termes IGN] requête spatiale [Termes IGN] SOLAP Résumé : (Auteur) The polygon amalgamation operation computes the boundary of the union of a set of polygons. This is an important operation for spatial on-line analytical processing and spatial data mining, where polygons representing different spatial objects often need to be amalgamated by varying criteria when the user wants to aggregate or reclassify these objects. The processing cost of this operation can be very high for a large number of polygons. Based on the observation that not all polygons to be amalgamated contribute to the boundary, we investigate in this paper efficient polygon amalgamation methods by excluding those internal polygons without retrieving them from the database. Two novel algorithms, adjacency-based and occupancy-based, are proposed. While both algorithms can reduce the amalgamation cost significantly, the occupancy-based algorithm is particularly attractive because : 1) it retrieves a smaller amount of data than the adjacency-based algorithm ; 2) it is based on a simple extension to a commonly used spatial indexing mechanism ; and 3) it can handle fuzzy amalgamation. Numéro de notice : C1999-058 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication DOI : 10.1007/3-540-48482-5_12 En ligne : https://doi.org/10.1007/3-540-48482-5_12 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=65824