Centre de documentation
scientifique

Improving map generalisation with new pruning heuristics / Patrick Taillandier in International journal of geographical information science IJGIS, vol 26 n° 7-8 (july - august 2012)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 26 n° 7-8 (july - august 2012) . - pp 1309 - 1323 Titre : Improving map generalisation with new pruning heuristics Type de document : Article/Communication Auteurs : Patrick Taillandier , Auteur ; Julien Gaffuri , Auteur Année de publication : 2012 Article en page(s) : pp 1309 - 1323 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] ajustement de paramètres [Termes IGN] analyse des besoins [Termes IGN] recherche heuristique [Vedettes matières IGN] Généralisation Résumé : (Auteur) Many automated generalisation methods are based on local search optimisation techniques: Starting from an initial state of the data, one or several new child states are produced using some transformation algorithms. These child states are then evaluated according to the final data requirements, and possibly used as new candidate state to transform. According to this approach, the generalisation process can be seen as a walk in a tree, each node representing a state of the data, and each link a transformation. In such an approach, the tree exploration heuristic has a great impact on the final result: Depending on which parts of the tree are either explored or pruned, the final result is different, and the process more or less computationally prohibitive. This article investigates the importance of exploration heuristic choice in automated generalisation. Different pruning criteria are proposed and tested on real generalisation cases. Recommendations on how to choose the pruning criterion depending on the need are provided. Numéro de notice : A2012-743 Affiliation des auteurs : COGIT+Ext (1988-2011) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2011.625948 Date de publication en ligne : 09/01/2012 En ligne : https://doi.org/10.1080/13658816.2011.625948 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91492 [article]

Exemplaires(2)

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

Search algorithms for multiway spatial joins / Dimitris Papadias in International journal of geographical information science IJGIS, vol 16 n° 7 (october 2002)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 16 n° 7 (october 2002) . - pp 613 - 639 Titre : Search algorithms for multiway spatial joins Type de document : Article/Communication Auteurs : Dimitris Papadias, Auteur ; D. Arkoumanis, Auteur Année de publication : 2002 Article en page(s) : pp 613 - 639 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] arbre-R [Termes IGN] jointure spatiale [Termes IGN] recherche heuristique [Termes IGN] requête spatiale [Termes IGN] temps réel Résumé : (Auteur) This paper deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) there is unlimited time and the goal is to retrieve a single exact solution, if such a solution exists, or the best approximate one otherwise. The first case is motivated by the high cost of join processing in real-time systems involving large amounts of multimedia data, while the second one is motivated by applications that require 'negative' examples. We propose several search algorithms for query processing under theses conditions. For the limited-time case we develop some non-deterministic search heuristics that can quickly retrieve good solutions. However, these heuristics are not guaranteed to find the best solutions, even without a time limit. Therefore, for the unfirnited-time case we describe systematic search algorithms tailored specifically for the efficient retrieval of a single solution. Both types of algorithms are integrated with R-trees in order to prune the search space. Our proposal is evaluated with extensive experimental comparison. Numéro de notice : A2002-209 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810210138733 En ligne : https://doi.org/10.1080/13658810210138733 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=22124 [article]

Exemplaires(1)

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

Ants can successfully design GPS surveying networks / H.A. Saleh in GPS world, vol 13 n° 9 (September 2002)

Public [article]  inGPS world > vol 13 n° 9 (September 2002) . - pp 50 - 61 Titre : Ants can successfully design GPS surveying networks Type de document : Article/Communication Auteurs : H.A. Saleh, Auteur Année de publication : 2002 Article en page(s) : pp 50 - 61 Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes de référence et réseaux [Termes IGN] cheminement topographique [Termes IGN] logistique [Termes IGN] optimisation par colonie de fourmis [Termes IGN] recherche heuristique [Termes IGN] réseau géodésique local Résumé : (Editeur) A common problem in making measurements on a GPS surveying network with a limited number of receivers is deciding the best order in which to visit the sites and carry out the observations. The optimum site occupation schedule would be the one which provides the best results with a minimum cost in time. How does one go about finding the best schedule ? It seems that ants know how. [...] This article explains how ants efficiently find their food using an indirect communication procedure and how their approach can be mimicked in designing GPS surveying networks. Numéro de notice : A2002-392 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26416 [article]

Exemplaires(1)

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

Tabu search heuristic for point-feature cartographic label placement / M. Yamamoto in Geoinformatica, vol 6 n° 1 (March - May 2002)  

Public [article]  inGeoinformatica > vol 6 n° 1 (March - May 2002) . - pp 77 - 90 Titre : Tabu search heuristic for point-feature cartographic label placement Type de document : Article/Communication Auteurs : M. Yamamoto, Auteur ; G. Camara, Auteur ; L.A. Lorena, Auteur Année de publication : 2002 Article en page(s) : pp 77 - 90 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Cartographie numérique [Termes IGN] placement automatique des signes conventionnels [Termes IGN] recherche heuristique Résumé : (Auteur) The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to display the geographic position of the features with their corresponding label in a clear and harmonious fashion, following accepted cartographic conventions. In this work, we have approached this problem from a combinatorial optimization point of view, and our research consisted of the evaluation of the tabu search (TS) heuristic applied to cartographic label placement. When compared, in real and random test cases, with techniques such as simulated annealing and genetic algorithm (GA), TS has proven to be an efficient choice, with the best performance in quality. We concluded that TS is a recommended method to solve cartographic label placement problem of point features, due to its simplicity, practicality, efficiency and good performance along with its ability to generate quality solutions in acceptable computational time. Numéro de notice : A2002-110 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1023/A:1013720231747 En ligne : https://doi.org/10.1023/A:1013720231747 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=22025 [article]

Exemplaires(1)

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