paper-with-me

홈 › Papers

PolygonGNN: Representation Learning for Polygonal Geometries with Heterogeneous Visibility Graph

2024-06-30 · Dazhou Yu, Yuntong Hu, Yun Li, Liang Zhao

Polygon representation learning is essential for diverse applications, encompassing tasks such as shape coding, building pattern classification, and geographic question answering. While recent years have seen considerable advancements in this field, much of the focus has been on single polygons, overlooking the intricate inner- and inter-polygonal relationships inherent in multipolygons. To address this gap, our study introduces a comprehensive framework specifically designed for learning representations of polygonal geometries, particularly multipolygons. Central to our approach is the incorporation of a heterogeneous visibility graph, which seamlessly integrates both inner- and inter-polygonal relationships. To enhance computational efficiency and minimize graph redundancy, we implement a heterogeneous spanning tree sampling method. Additionally, we devise a rotation-translation invariant geometric representation, ensuring broader applicability across diverse scenarios. Finally, we introduce Multipolygon-GNN, a novel model tailored to leverage the spatial and semantic heterogeneity inherent in the visibility graph. Experiments on five real-world and synthetic datasets demonstrate its ability to capture informative representations for polygonal geometries.

📄 PDF Abstract BibTeX arXiv:2407.00742

Code (1)

dyu62/PolyGNN 공식 구현 pytorch

Tasks

Computational EfficiencyGeographic Question AnsweringQuestion AnsweringRepresentation Learning

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Towards General-Purpose Representation Learning of Polygonal Geometries

2022-09-29 · Gengchen Mai, Chiyu Jiang, Weiwei Sun, Rui Zhu 외

Neural network representation learning for spatial data is a common need for geographic artificial intelligence (GeoAI) problems. In recent years, many advancements have been made in representation learning for points, p…

Relation PredictionRepresentation Learning

SeMAnD: Self-Supervised Anomaly Detection in Multimodal Geospatial Datasets

2023-09-26 · Daria Reshetova, Swetava Ganguli, C. V. Krishnakumar Iyer, Vipul Pandey

We propose a Self-supervised Anomaly Detection technique, called SeMAnD, to detect geometric anomalies in Multimodal geospatial datasets. Geospatial data comprises of acquired and derived heterogeneous data modalities th…

Anomaly ClassificationAnomaly DetectionData AugmentationRecommendation Systems+2

Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

2018-08-13 · Shizhe Zhao, Daniel D. Harabor, David Taniar

We are interested in the problem of finding $k$ nearest neighbours in the plane and in the presence of polygonal obstacles ($\textit{OkNN}$). Widely used algorithms for OkNN are based on incremental visibility graphs, wh…

Polygonal network disorder and the turning distance

2025-03-09 · Alex Dolce, Ryan Lavelle, Bernard Scott, Ashlyn Urbanski 외

The turning distance is an efficient metric for measuring the similarity between two polygons. This metric is constructed by taking an $L^p$ distance between step functions which track each shape's tangent angle of a pat…

Pursuit Winning Strategies for Reach-Avoid Games with Polygonal Obstacles

2024-03-10 · Rui Yan, Shuai Mi, Xiaoming Duan, Jintao Chen 외

This paper studies a multiplayer reach-avoid differential game in the presence of general polygonal obstacles that block the players' motions. The pursuers cooperate to protect a convex region from the evaders who try to…