Topology-Preserving Data Augmentation for Ring-Type Polygon Annotations

• URL: http://arxiv.org/abs/2603.14764v2
• Date: Tue, 17 Mar 2026 04:01:44 GMT
• Title: Topology-Preserving Data Augmentation for Ring-Type Polygon Annotations
• Abstract summary: In architectural analysis, ring-type regions are often encoded as a single cyclic polygon chain connecting outer and inner boundaries.<n>In this work, we introduce an order-preserving polygon augmentation strategy that performs floorplan transformations in mask space.<n> Experiments demonstrate that the approach reliably restores connectivity, achieving near-perfect Cyclic Adjacency Preservation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Geometric data augmentation is widely used in segmentation pipelines and typically assumes that polygon annotations represent simply connected regions. However, in structured domains such as architectural floorplan analysis, ring-type regions are often encoded as a single cyclic polygon chain connecting outer and inner boundaries. During augmentation, clipping operations may remove intermediate vertices and disrupt this cyclic connectivity, breaking the structural relationship between the boundaries. In this work, we introduce an order-preserving polygon augmentation strategy that performs transformations in mask space and then projects surviving vertices back into index-space to restore adjacency relations. This repair maintains the original traversal order of the polygon and preserves topological consistency with minimal computational overhead. Experiments demonstrate that the approach reliably restores connectivity, achieving near-perfect Cyclic Adjacency Preservation (CAP) across both single and compound augmentations.

Related papers

• Topologically Consistent Agricultural Parcel Vectorization with Semantic-Guided Diffusion and Topology-Aware Polygonization [3.6139826652790865]
  Agricultural parcel polygons play a fundamental role in geospatial applications such as precision agriculture, land administration, and crop monitoring.<n>We propose a semantic-guided framework for topologically consistent agricultural parcel vectorization.
  arXiv  Detail & Related papers  (2026-09-07T14:02:48Z)
• Learning to Tessellate: Point Cloud Generation via Recursive Spectral Partitioning [58.130498928480456]
  We present PointRSP, an autoregressive framework that reformulates point cloud generation as a topology-preserving tessellation process.<n>PointRSP achieves state-of-the-art performance in generation quality and diversity, demonstrating strong generalization across complex 3D topologies.
  arXiv  Detail & Related papers  (2026-08-03T16:11:43Z)
• \ extit{4DSurf}: High-Fidelity Dynamic Scene Surface Reconstruction [53.82595920033838]
  This paper addresses the problem of dynamic scene surface reconstruction using Gaussian Splatting (GS)<n>We propose textit4DSurf'', a novel and unified framework for generic dynamic surface reconstruction.<n>Our method outperforms state-of-the-art surface reconstruction methods by 49% and 19% in Chamfer distance.
  arXiv  Detail & Related papers  (2026-03-30T06:09:37Z)
• GeoReFormer: Geometry-Aware Refinement for Lane Segment Detection and Topology Reasoning [0.7769712273444055]
  GeoReFormer is a query-based architecture that embeds geometry- and topology-aware inductive biases directly within the transformer decoder.<n>GeoReFormer achieves state-of-the-art performance with 34.5% mAP on the OpenLane-V2 benchmark.
  arXiv  Detail & Related papers  (2026-03-27T02:26:12Z)
• Flatten The Complex: Joint B-Rep Generation via Compositional $k$-Cell Particles [22.846357150067927]
  Boundary Representation (B-Reps) is the widely adopted standard in Computer Design (CAD) andAided modeling.<n>Previous methods rely on sequences to handle this hierarchy which fails to fully exploit the geometric relationships between cells.
  arXiv  Detail & Related papers  (2026-01-25T08:00:28Z)
• GFLAN: Generative Functional Layouts [1.1458853556386797]
  GFLAN is a generative framework that restructures floor plan synthesis through explicit factorization into topological planning and geometric realization.<n>Our approach departs from direct pixel-to-pixel or wall-tracing generation in favor of a principled two-stage decomposition.
  arXiv  Detail & Related papers  (2025-12-18T07:52:47Z)
• GraphShaper: Geometry-aware Alignment for Improving Transfer Learning in Text-Attributed Graphs [16.624063216788638]
  We introduce textbfGraphShaper, a geometry-aware framework that enhances graph encoding through multi-geometric specialization.<n>Our approach employs expert networks tailored to different geometric spaces, dynamically computing fusion weights to adaptively integrate geometric properties.<n>It achieves 9.47% accuracy improvements on citation networks and 7.63% on social networks in zero-shot settings.
  arXiv  Detail & Related papers  (2025-10-14T02:48:50Z)
• SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes [61.110517195874074]
  We present a scheme to directly generate manifold, polygonal meshes of complex connectivity as the output of a neural network.<n>Our key innovation is to define a continuous latent connectivity space at each mesh, which implies the discrete mesh.<n>In applications, this approach not only yields high-quality outputs from generative models, but also enables directly learning challenging geometry processing tasks such as mesh repair.
  arXiv  Detail & Related papers  (2024-09-30T17:59:03Z)
• PolygonGNN: Representation Learning for Polygonal Geometries with Heterogeneous Visibility Graph [8.971120205703887]
  We introduce a framework specifically designed for learning representations of polygonal geometries, particularly multipolygons.<n>We also introduce Multipolygon-GNN, a novel model tailored to leverage the spatial and semantic heterogeneity inherent in the visibility graph.<n>Experiments on five real-world and synthetic datasets demonstrate Multipolygon-GNN's ability to capture informative representations for polygonal geometries.
  arXiv  Detail & Related papers  (2024-06-30T16:07:49Z)
• P2PFormer: A Primitive-to-polygon Method for Regular Building Contour Extraction from Remote Sensing Images [5.589842901102337]
  Existing methods struggle with irregular contours, rounded corners, and redundancy points.<n>We introduce a novel, streamlined pipeline that generates regular building contours without post-processing.<n>P2PFormer achieves new state-of-the-art performance on the WHU, CrowdAI, and WHU-Mix datasets.
  arXiv  Detail & Related papers  (2024-06-05T04:38:45Z)
• Exploring Data Geometry for Continual Learning [64.4358878435983]
  We study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space.
  arXiv  Detail & Related papers  (2023-04-08T06:35:25Z)
• Recurrent Generic Contour-based Instance Segmentation with Progressive Learning [111.31166268300817]
  We propose a novel deep network architecture, i.e., PolySnake, for generic contour-based instance segmentation. Motivated by the classic Snake algorithm, the proposed PolySnake achieves superior and robust segmentation performance.
  arXiv  Detail & Related papers  (2023-01-21T05:34:29Z)
• Rethinking Learnable Tree Filter for Generic Feature Transform [71.77463476808585]
  Learnable Tree Filter presents a remarkable approach to model structure-preserving relations for semantic segmentation. To relax the geometric constraint, we give the analysis by reformulating it as a Markov Random Field and introduce a learnable unary term. For semantic segmentation, we achieve leading performance (82.1% mIoU) on the Cityscapes benchmark without bells-and-whistles.
  arXiv  Detail & Related papers  (2020-12-07T07:16:47Z)

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.