Reconstruction of Contour Lines During the Digitization of Contour Maps to Build a Digital Elevation Model
- URL: http://arxiv.org/abs/2412.15515v1
- Date: Fri, 20 Dec 2024 03:02:42 GMT
- Title: Reconstruction of Contour Lines During the Digitization of Contour Maps to Build a Digital Elevation Model
- Abstract summary: broken contour segments impose a greater risk while building a Digital Elevation Model (DEM)<n>In this project, a simple yet efficient mechanism is used to match and reconnect the endpoints of the broken segments accurately and efficiently.<n>The purpose of this work is to reconnect the broken contour lines generated during the digitization of the contour map, to help build the most appropriate digital elevation model for the corresponding contour map.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Contour map has contour lines that are significant in building a Digital Elevation Model (DEM). During the digitization and pre-processing of contour maps, the contour line intersects with each other or break apart resulting in broken contour segments. These broken segments impose a greater risk while building DEM leading to a faulty model. In this project, a simple yet efficient mechanism is used to match and reconnect the endpoints of the broken segments accurately and efficiently. The matching of the endpoints is done using the concept of minimum Euclidean distance and gradient direction while the Cubic Hermite spline interpolation technique is used to reconnect the endpoints by estimating the values using a mathematical function that minimizes overall surface curvature resulting in a smooth curve. The purpose of this work is to reconnect the broken contour lines generated during the digitization of the contour map, to help build the most appropriate digital elevation model for the corresponding contour map.
Related papers
- Autoregressive B-Rep Shape Generation with Parametric Surfaces [83.03418080213359]
ParaCAD is an autoregressive framework for point-cloud-conditioned B-Rep generation.<n>Our model first generates parametric surfaces with constrained UV domains, and then constructs a valid B-Rep by globally intersecting these surfaces.<n>Extensive experiments demonstrate that ParaCAD produces accurate B-Reps with faithful point-cloud alignment.
arXiv Detail & Related papers (2026-07-19T06:14:50Z) - Artic-O: End-to-End Articulated Object Reconstruction via Latent Geometry Learning [105.35529379360186]
Artic-O is an end-to-end, feed-forward framework for articulated object reconstruction.<n>It maps sparse multi-state observations into a pretrained latent geometry space.<n>A frozen flow-matching decoder provides a complete-shape prior for recovering visible and occluded structures.
arXiv Detail & Related papers (2026-06-20T08:15:30Z) - Point or Line? Using Line-based Representation for Panoptic Symbol Spotting in CAD Drawings [67.5600169375126]
We study the task of panoptic symbol spotting in computer-aided design (CAD) drawings composed of vector graphical primitives.<n>Existing methods typically rely on imageization, graph construction, or point-based representation.<n>We propose VecFormer, a novel method that addresses these challenges through line-based representation of primitives.
arXiv Detail & Related papers (2025-05-29T12:33:11Z) - Curvy: A Parametric Cross-section based Surface Reconstruction [2.1165011830664677]
We present a novel approach for reconstructing shape point clouds using planar sparse cross-sections with the help of generative modeling.
We use a compact parametric polyline representation using adaptive splitting to represent the cross-sections and perform learning using a Graph Neural Network to reconstruct the underlying shape.
arXiv Detail & Related papers (2024-09-01T20:15:08Z) - Geometrically Consistent Partial Shape Matching [50.29468769172704]
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics.
An often neglected but essential property of matching geometrics is consistency.
We propose a novel integer linear programming partial shape matching formulation.
arXiv Detail & Related papers (2023-09-10T12:21:42Z) - Generation of High Spatial Resolution Terrestrial Surface from Low
Spatial Resolution Elevation Contour Maps via Hierarchical Computation of
Median Elevation Regions [2.4265283126387165]
The conversion is similar to that of the generation of high-resolution DEM from its low-resolution DEM.
It is a sequential step of the I) decomposition of the existing sparse Contour map into the maximum possible Threshold Elevation Region (TERs)
arXiv Detail & Related papers (2023-07-18T13:19:39Z) - 3D Line Mapping Revisited [86.13455066577657]
LIMAP is a library for 3D line mapping that robustly and efficiently creates 3D line maps from multi-view imagery.
Our code integrates seamlessly with existing point-based Structure-from-Motion methods.
Our robust 3D line maps also open up new research directions.
arXiv Detail & Related papers (2023-03-30T16:14:48Z) - ContourRender: Detecting Arbitrary Contour Shape For Instance
Segmentation In One Pass [48.57232627854642]
We argue that the difficulty in regressing the contour points in one pass is mainly due to the ambiguity when discretizing a smooth contour into a polygon.
To address the ambiguity, we propose a novel differentiable rendering-based approach named textbfContourRender.
It first predicts a contour generated by an invertible shape signature, and then optimize the contour with the more stable silhouette by converting it to a contour mesh and rendering the mesh to a 2D map.
arXiv Detail & Related papers (2021-06-07T07:23:03Z) - Cloud2Curve: Generation and Vectorization of Parametric Sketches [109.02932608241227]
We present Cloud2Curve, a generative model for scalable high-resolution vector sketches.
We evaluate the generation and vectorization capabilities of our model on Quick, Draw! and KMNIST datasets.
arXiv Detail & Related papers (2021-03-29T12:09:42Z) - ContourRend: A Segmentation Method for Improving Contours by Rendering [10.13129256609938]
Mask-based segmentation can not handle contour features well on a coarse prediction grid.
We propose Contourend which adopts convolution contour to refine segmentation contours.
Our method reaches 72.41% mean intersection over union (IoU) and surpasses baseline Polygon-GCN by 1.22%.
arXiv Detail & Related papers (2020-07-15T02:16:00Z) - Quantization in Relative Gradient Angle Domain For Building Polygon
Estimation [88.80146152060888]
CNN approaches often generate imprecise building morphologies including noisy edges and round corners.
We propose a module that uses prior knowledge of building corners to create angular and concise building polygons from CNN segmentation outputs.
Experimental results demonstrate that our method refines CNN output from a rounded approximation to a more clear-cut angular shape of the building footprint.
arXiv Detail & Related papers (2020-07-10T21:33:06Z) - ProAlignNet : Unsupervised Learning for Progressively Aligning Noisy
Contours [12.791313859673187]
"ProAlignNet" accounts for large scale misalignments and complex transformations between the contour shapes.
It learns by training with a novel loss function which is derived an upperbound of a proximity-sensitive and local shape-dependent similarity metric.
In two real-world applications, the proposed models consistently perform superior to state-of-the-art methods.
arXiv Detail & Related papers (2020-05-23T14:56:14Z) - Monocular Human Pose and Shape Reconstruction using Part Differentiable
Rendering [53.16864661460889]
Recent works succeed in regression-based methods which estimate parametric models directly through a deep neural network supervised by 3D ground truth.
In this paper, we introduce body segmentation as critical supervision.
To improve the reconstruction with part segmentation, we propose a part-level differentiable part that enables part-based models to be supervised by part segmentation.
arXiv Detail & Related papers (2020-03-24T14:25:46Z)
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.