Generating grid maps via the snake model

• URL: http://arxiv.org/abs/2406.18573v1
• Date: Tue, 4 Jun 2024 02:24:39 GMT
• Title: Generating grid maps via the snake model
• Authors: Zhiwei Wei, Nai Yang, Wenjia Xu, Su Ding,
• Abstract summary: The grid map, often referred to as the tile map, stands as a vital tool in geospatial visualization. It transforms geographic regions into grids, which requires the displacement of both region centroids and boundary nodes to establish a coherent grid arrangement. Existing approaches typically displace region centroids and boundary nodes separately, potentially resulting in self-intersected boundaries. We introduce a novel approach that leverages the Snake displacement algorithm from cartographic generalization to concurrently displace region centroids and boundary nodes.
• Score: 10.489493860187348
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The grid map, often referred to as the tile map, stands as a vital tool in geospatial visualization, possessing unique attributes that differentiate it from more commonly known techniques such as choropleths and cartograms. It transforms geographic regions into grids, which requires the displacement of both region centroids and boundary nodes to establish a coherent grid arrangement. However, existing approaches typically displace region centroids and boundary nodes separately, potentially resulting in self-intersected boundaries and compromised relative orientation relations between regions. In this paper, we introduce a novel approach that leverages the Snake displacement algorithm from cartographic generalization to concurrently displace region centroids and boundary nodes. The revised Constrained Delaunay triangulation (CDT) is employed to represent the relations between regions and serves as a structural foundation for the Snake algorithm. Forces for displacing the region centroids into a grid-like pattern are then computed. These forces are iteratively applied within the Snake model until a satisfactory new boundary is achieved. Subsequently, the grid map is created by aligning the grids with the newly generated boundary, utilizing a one-to-one match algorithm to assign each region to a specific grid. Experimental results demonstrate that the proposed approach excels in maintaining the relative orientation and global shape of regions, albeit with a potential increase in local location deviations. We also present two strategies aligned with existing approaches to generate diverse grid maps for user preferences. Further details and resources are available on our project website: https://github.com/TrentonWei/DorlingMap.git.

Related papers

• HPix: Generating Vector Maps from Satellite Images [0.0]
  We propose a novel method called HPix, which utilizes modified Generative Adversarial Networks (GANs) to generate vector tile map from satellite images. Through empirical evaluations, our proposed approach showcases its effectiveness in producing highly accurate and visually captivating vector tile maps. We further extend our study's application to include mapping of road intersections and building footprints cluster based on their area.
  arXiv  Detail & Related papers  (2024-07-18T16:54:02Z)
• Differentiable Reasoning about Knowledge Graphs with Region-based Graph Neural Networks [62.93577376960498]
  Methods for knowledge graph (KG) completion need to capture semantic regularities and use these regularities to infer plausible knowledge that is not explicitly stated. Most embedding-based methods are opaque in the kinds of regularities they can capture, although region-based KG embedding models have emerged as a more transparent alternative. We propose RESHUFFLE, a simple model based on ordering constraints that can faithfully capture a much larger class of rule bases than existing approaches.
  arXiv  Detail & Related papers  (2024-06-13T18:37:24Z)
• Coupled Laplacian Eigenmaps for Locally-Aware 3D Rigid Point Cloud Matching [0.0]
  We propose a new technique, based on graph Laplacian eigenmaps, to match point clouds by taking into account fine local structures. To deal with the order and sign ambiguity of Laplacian eigenmaps, we introduce a new operator, called Coupled Laplacian. We show that the similarity between those aligned high-dimensional spaces provides a locally meaningful score to match shapes.
  arXiv  Detail & Related papers  (2024-02-27T10:10:12Z)
• Boundary Attention: Learning curves, corners, junctions and grouping [23.467103272604906]
  We present a lightweight network that infers grouping and boundaries, including curves, corners and junctions. It operates in a bottom-up fashion, analogous to classical methods for sub-pixel edge localization and edge-linking. Our network uses a mechanism that we call boundary attention a geometry-aware local attention operation.
  arXiv  Detail & Related papers  (2024-01-01T19:00:55Z)
• Geo-Encoder: A Chunk-Argument Bi-Encoder Framework for Chinese Geographic Re-Ranking [61.60169764507917]
  Chinese geographic re-ranking task aims to find the most relevant addresses among retrieved candidates. We propose an innovative framework, namely Geo-Encoder, to more effectively integrate Chinese geographical semantics into re-ranking pipelines.
  arXiv  Detail & Related papers  (2023-09-04T13:44:50Z)
• Region Prediction for Efficient Robot Localization on Large Maps [5.75614168271028]
  We propose a novel approach to pre-select a subset of map nodes for place recognition. The region labels become the prediction targets of a deep neural network and, during navigation, only the nodes associated with the regions predicted with high probability are considered for matching.
  arXiv  Detail & Related papers  (2023-03-01T07:42:48Z)
• Semantic Segmentation by Early Region Proxy [53.594035639400616]
  We present a novel and efficient modeling that starts from interpreting the image as a tessellation of learnable regions. To model region-wise context, we exploit Transformer to encode regions in a sequence-to-sequence manner. Semantic segmentation is now carried out as per-region prediction on top of the encoded region embeddings.
  arXiv  Detail & Related papers  (2022-03-26T10:48:32Z)
• Hex2vec -- Context-Aware Embedding H3 Hexagons with OpenStreetMap Tags [9.743315439284407]
  We propose the first approach to learning vector representations of regions with respect to urban functions and land-use in a micro-region grid. We identify a subset of OpenStreetMap tags related to major characteristics of land-use, building and urban region functions, types of water, green or other natural areas. The resulting vector representations showcase semantic structures of the map characteristics, similar to ones found in vector-based language models.
  arXiv  Detail & Related papers  (2021-11-01T14:22:53Z)
• Neural Subdivision [58.97214948753937]
  This paper introduces Neural Subdivision, a novel framework for data-driven coarseto-fine geometry modeling. We optimize for the same set of network weights across all local mesh patches, thus providing an architecture that is not constrained to a specific input mesh, fixed genus, or category. We demonstrate that even when trained on a single high-resolution mesh our method generates reasonable subdivisions for novel shapes.
  arXiv  Detail & Related papers  (2020-05-04T20:03:21Z)
• A Rotation-Invariant Framework for Deep Point Cloud Analysis [132.91915346157018]
  We introduce a new low-level purely rotation-invariant representation to replace common 3D Cartesian coordinates as the network inputs. Also, we present a network architecture to embed these representations into features, encoding local relations between points and their neighbors, and the global shape structure. We evaluate our method on multiple point cloud analysis tasks, including shape classification, part segmentation, and shape retrieval.
  arXiv  Detail & Related papers  (2020-03-16T14:04:45Z)
• PUGeo-Net: A Geometry-centric Network for 3D Point Cloud Upsampling [103.09504572409449]
  We propose a novel deep neural network based method, called PUGeo-Net, to generate uniform dense point clouds. Thanks to its geometry-centric nature, PUGeo-Net works well for both CAD models with sharp features and scanned models with rich geometric details.
  arXiv  Detail & Related papers  (2020-02-24T14:13:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.