SIGDT: 2D Curve Reconstruction

Determining connectivity between points and reconstructing their shape boundaries are long‐standing problems in computer graphics. One possible approach to solve these problems is to use a proximity graph. We propose a new proximity graph computed by intersecting the to‐date rarely used proximity‐ba...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum 2022-10, Vol.41 (7), p.25-36
Main Authors: Marin, D., Ohrhallinger, S., Wimmer, M.
Format: Article
Language:English
Subjects:
Algorithms
CCS Concepts
Computer graphics
Computing methodologies → Point‐based models
Delaunay triangulation
Image reconstruction
Proximity
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Determining connectivity between points and reconstructing their shape boundaries are long‐standing problems in computer graphics. One possible approach to solve these problems is to use a proximity graph. We propose a new proximity graph computed by intersecting the to‐date rarely used proximity‐based graph called spheres‐of‐influence graph (SIG) with the Delaunay triangulation (DT). We prove that the resulting graph, which we name SIGDT, contains the piece‐wise linear reconstruction for a set of unstructured points in the plane for a sampling condition superseding current bounds and capturing well practical point sets' properties. As an application, we apply a dual of boundary adjustment steps from the Connect2D algorithm to remove the redundant edges. We show that the resulting algorithm SIG‐Connect2D yields the best reconstruction accuracy compared to state‐of‐the‐art algorithms from a recent comprehensive benchmark, and the method offers the potential for further improvements, e.g., for surface reconstruction.
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.14654