Détail de l'auteur
Auteur Martijn Meijers |
Documents disponibles écrits par cet auteur (6)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
SplitArea: an algorithm for weighted splitting of faces in the context of a planar partition / Martijn Meijers in International journal of geographical information science IJGIS, vol 30 n° 7- 8 (July - August 2016)
[article]
Titre : SplitArea: an algorithm for weighted splitting of faces in the context of a planar partition Type de document : Article/Communication Auteurs : Martijn Meijers, Auteur ; Sandro Savino, Auteur ; Peter J. M. Van Oosterom, Auteur Année de publication : 2016 Article en page(s) : pp 1522 - 1551 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] données vectorielles
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] modèle topologique de données
[Termes IGN] système d'information géographique
[Termes IGN] Triangulated Irregular Network
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) Geographic data themes modelled as planar partitions are found in many GIS applications (e.g. topographic data, land cover, zoning plans, etc.). When generalizing this kind of 2D map, this specific nature has to be respected and generalization operations should be carefully designed. This paper presents a design and implementation of an algorithm to perform a split operation of faces (polygonal areas).
The result of the split operation has to fit in with the topological data structure supporting variable-scale data. The algorithm, termed SPLITAREA, obtains the skeleton of a face using a constrained Delaunay triangulation. The new split operator is especially relevant in urban areas with many infrastructural objects such as roads. The contribution of this work is twofold: (1) the quality of the split operation is formally assessed by comparing the results on actual test data sets with a goal/metric we defined beforehand for the ‘balanced’ split and (2) the algorithm allows a weighted split, where different neighbours have different weights due to different compatibility. With the weighted split, the special case of unmovable boundaries is also explicitly addressed.
The developed split algorithm can also be used outside the generalization context in other settings. For example, to make two cross-border data sets fit, the algorithm could be applied to allow splitting of slivers.Numéro de notice : A2016-318 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2016.1140770 En ligne : http://dx.doi.org/10.1080/13658816.2016.1140770 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=80938
in International journal of geographical information science IJGIS > vol 30 n° 7- 8 (July - August 2016) . - pp 1522 - 1551[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-2016042 RAB Revue Centre de documentation En réserve L003 Disponible 079-2016041 RAB Revue Centre de documentation En réserve L003 Disponible Engineering web maps with gradual content zoom based on streaming vector data / Lina Huang in ISPRS Journal of photogrammetry and remote sensing, vol 114 (April 2016)
[article]
Titre : Engineering web maps with gradual content zoom based on streaming vector data Type de document : Article/Communication Auteurs : Lina Huang, Auteur ; Martijn Meijers, Auteur ; Radan Šuba, Auteur ; Peter J. M. Van Oosterom, Auteur Année de publication : 2016 Article en page(s) : pp 274 – 293 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] données vectorielles
[Termes IGN] échelle cartographique
[Termes IGN] web mapping
[Termes IGN] zoom
[Vedettes matières IGN] GéovisualisationRésumé : (auteur) Vario-scale data structures have been designed to support gradual content zoom and the progressive transfer of vector data, for use with arbitrary map scales. The focus to date has been on the server side, especially on how to convert geographic data into the proposed vario-scale structures by means of automated generalisation. This paper contributes to the ongoing vario-scale research by focusing on the client side and communication, particularly on how this works in a web-services setting. It is claimed that these functionalities are urgently needed, as many web-based applications, both desktop and mobile, require gradual content zoom, progressive transfer and a high performance level. The web-client prototypes developed in this paper make it possible to assess the behaviour of vario-scale data and to determine how users will actually see the interactions. Several different options of web-services communication architectures are possible in a vario-scale setting. These options are analysed and tested with various web-client prototypes, with respect to functionality, ease of implementation and performance (amount of transmitted data and response times). We show that the vario-scale data structure can fit in with current web-based architectures and efforts to standardise map distribution on the internet. However, to maximise the benefits of vario-scale data, a client needs to be aware of this structure. When a client needs a map to be refined (by means of a gradual content zoom operation), only the ‘missing’ data will be requested. This data will be sent incrementally to the client from a server. In this way, the amount of data transferred at one time is reduced, shortening the transmission time. In addition to these conceptual architecture aspects, there are many implementation and tooling design decisions at play. These will also be elaborated on in this paper. Based on the experiments conducted, we conclude that the vario-scale approach indeed supports gradual content zoom and the progressive web transfer of vector data. This is a big step forward in making vector data at arbitrary map scales available to larger user groups. Numéro de notice : A2016-538 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.isprsjprs.2015.11.011 En ligne : https://doi.org/10.1016/j.isprsjprs.2015.11.011 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81682
in ISPRS Journal of photogrammetry and remote sensing > vol 114 (April 2016) . - pp 274 – 293[article]Topologically consistent 3D city models obtained by extrusion / Hugo Ledoux in International journal of geographical information science IJGIS, vol 25 n° 4-5 (May 2011)
[article]
Titre : Topologically consistent 3D city models obtained by extrusion Type de document : Article/Communication Auteurs : Hugo Ledoux, Auteur ; Martijn Meijers, Auteur Année de publication : 2011 Article en page(s) : pp 557 - 574 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Photogrammétrie numérique
[Termes IGN] CityGML
[Termes IGN] intégrité topologique
[Termes IGN] modèle 3D de l'espace urbain
[Termes IGN] programmation par contraintes
[Termes IGN] Triangulated Irregular Network
[Termes IGN] triangulation de DelaunayRésumé : Auteur) One of the simplest methods to construct a 3D city model is to extrude building footprints to obtain “block-shaped" polyhedra representing buildings. While the method is well-known and easy to implement, if the 2D topological relationships between the footprints are not taken into account, the resulting 3D city models will not necessarily be topologically consistent (i.e. primitives shared by 3D buildings will be duplicated and/or intersect each others). As a result, the model will be of little use for most applications, besides visualisation that is. In this paper, we present a new extrusion procedure to construct topologically correct 3D city models. It is based on the use of a constrained triangulation, is conceptually simple, and offers great flexibility to create city models in different formats (e.g. CityGML or a surface-based representation). We have implemented the procedure, tested it with real-world datasets, and validated it. Numéro de notice : A2011-566 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1080/13658811003623277 En ligne : http://dx.doi.org/10.1080/13658811003623277 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=79398
in International journal of geographical information science IJGIS > vol 25 n° 4-5 (May 2011) . - pp 557 - 574[article]Réservation
Réserver ce documentExemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité 079-2011032 RAB Revue Centre de documentation En réserve L003 Disponible 079-2011031 SL Revue Centre de documentation Revues en salle Disponible Simultaneous & topologically-safe line simplification for a variable-scale planar partition / Martijn Meijers (31/01/2011)
Titre : Simultaneous & topologically-safe line simplification for a variable-scale planar partition Type de document : Article/Communication Auteurs : Martijn Meijers, Auteur Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 31/01/2011 Conférence : AGILE 2011, 14th International Conference on Geographic Information Science, Advancing Geoinformation Science for a Changing World 18/04/2011 21/04/2011 Utrecht Pays-Bas Proceedings Springer Importance : pp 337 - 358 Format : 21 x 30 cm Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] généralisation automatique de données
[Termes IGN] graphe planaire
[Termes IGN] lissage de courbe
[Termes IGN] partition de surface
[Termes IGN] simplification de contour
[Vedettes matières IGN] GénéralisationRésumé : (Auteur) We employ a batch generalization process for obtaining a variable-scale planar partition. We describe an algorithm to simplify the boundary lines after a map generalization operation (either a merge or a split operation) has been applied on a polygonal area and its neighbours. The simplification is performed simultaneously on the resulting boundaries of the new polygonal areas that replace the areas that were processed. As the simplification strategy has to keep the planar partition valid, we define what we consider to be a valid planar partition (among other requirements, no zero-sized areas and no unwanted intersections in the boundary polylines). Furthermore, we analyse the effects of the line simplification for the content of the data structures in which the planar partition is stored. Numéro de notice : C2011-023 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Communication nature-HAL : ComAvecCL&ActesPubliésIntl Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=64364 Documents numériques
en open access
14509_ctap_line_simplification_for_variable-scale.pdfAdobe Acrobat PDF
Titre : Variable-scale Geo-information Type de document : Thèse/HDR Auteurs : Martijn Meijers, Auteur Editeur : Delft [Pays-Bas] : Delft University of Technology Année de publication : 2011 Importance : 235 p. Format : 21 x 30 cm ISBN/ISSN/EAN : 978-90-6132-335-8 Note générale : Bibliographie
PhD thesis Delft University of TechnologyLangues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] données localisées 2D
[Termes IGN] données multiéchelles
[Termes IGN] généralisation cartographique automatisée
[Termes IGN] lissage de données
[Termes IGN] modèle conceptuel de données localisées
[Termes IGN] représentation multiple
[Termes IGN] structure de données localisées
[Termes IGN] variation d'échelleNote de contenu : 1 Setting the scene
1.1 Motivation for maps at variable scale
1.2 Objective and Research questions
1.3 Research scope
1.4 Methodology
1.5 Thesis outline
2 Research background
2.1 Modelling digital geographic space
2.2 From single-scale to multi-scale maps
2.3 Multi-scale hierarchies
2.4 Vario-scale structures
2.5 Progressive data transfer
2.6 Starting points for data at variable scale
3 Formalising valid vario-scale data
3.1 A preference for minimal redundancy
3.2 Formalisation of variable-scale partitions
3.3 Validation (and repair) of a 2d input partition
3.4 Closing remarks
4 Improving variable-scale data structures
4.1 Minimally redundant data storage
4.2 Simultaneous, topologically-safe line simplification
4.3 Collapsing areas: splitting over multiple neighbours
4.4 Closing remarks
5 Improving vario-scale data dissemination
5.1 Quantitative importance-setting approach
5.2 2d map for a thin client
5.3 Progressive data streaming
5.4 A cache-friendly and stateful solution
5.5 Closing remarks
6 A new era: smooth vario-scale data
6.1 Lessons learnt: a synthesis
6.2 Smooth data for the space-scale cube
6.3 Exploring possible drawbacks
6.4 Closing remarks
7 Conclusions and Future work
7.1 Conclusions
7.2 Recommendations for further researchNuméro de notice : 14464 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Thèse étrangère Note de thèse : Thèse de doctorat : : Pays-Bas, Delft : 2011 DOI : sans En ligne : https://www.ncgeo.nl/index.php/en/publicatiesgb/publications-on-geodesy/item/257 [...] Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=45252 Permalink