Reconstruction of water-tight surfaces through Delaunay sculpting

نویسندگان

  • Jiju Peethambaran
  • Ramanathan Muthuganapathy
چکیده

Given a finite set of points S ⊆ R, we define a proximity graph called as shape-hull graph(SHG(S)) that contains all Gabriel edges and a few non-Gabriel edges of Delaunay triangulation of S. For any S, SHG(S) is topologically regular with its boundary (referred to as shape-hull(SH)) homeomorphic to a simple closed curve. We introduce the concept of divergent concavity for simple, closed, planar curves based on the alignment of curves in concave portions and discuss various measures to characterize curves having divergent concavity. Under sufficiently dense sampling, we prove that SH(S), where S is sampled from a divergent concave curve ΣD, represents a piece-wise linear approximation of ΣD. We extend this result to provide a sculpting algorithm for closed surface reconstruction from a set of raw samples. The surface is constructed through a repeated elimination of Delaunay tetrahedra subjected to circumcenter and topological constraints. Theoretically, we justify our algorithm by establishing a topological guarantee on the 3D shape-hull with the help of topological rules. We demonstrate the effectiveness of our approach with experimental results on models with sharp features and sparsely distributed point clouds. Compared to existing sculpting approaches for surface reconstruction that require either a parameter tuning or several stages, our approach is simple, non-parametric, single stage and reconstructs topologically correct piece-wise linear approximation for divergent concave surfaces.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstruction of Virtual Parts from Unorganized Scanned Data for Automated Dimensional Inspection

In the framework of Virtual CMM [1], virtual parts are proposed to be constructed as triangulated surface models. This paper presents a novel surface reconstruction method to the creation of virtual parts. It is based on the idea of identification and sculpting of concave regions of a Delaunay triangulation of the sample data. The proposed algorithm is capable of handling the reconstruction of ...

متن کامل

Hallucination-Free Multi-View Stereo

We present a multi-view stereo method that avoids producing hallucinated surfaces which do not correspond to real surfaces. Our approach to 3D reconstruction is based on the minimal s-t cut of the graph derived from the Delaunay tetrahedralization of a dense 3D point cloud, which produces water-tight meshes. This is often a desirable property but it hallucinates surfaces in complicated scenes w...

متن کامل

A non-parametric approach to shape reconstruction from planar point sets through Delaunay filtering

In this paper, we present a fully automatic Delaunay based sculpting algorithm for approximating the shape of a finite set of points S in R2. The algorithm generates a relaxed Gabriel graph (RGG) that consists of most of the Gabriel edges and a few non-Gabriel edges induced by the Delaunay triangulation. Holes are characterized through a structural pattern called as body-arm formed by the Delau...

متن کامل

Tri-Dexel Volumetric Modeling for Haptic Sculpting and Virtual Prototyping of Complex Surfaces

This paper presents a new tri-dexel volumetric modeling method for representing complex geometric models in applications such as haptic virtual sculpting and product prototyping. A tri-dexel model consists of three overlapping dexel models in X, Y, and Z axis directions, respectively. Detailed algorithms of eliminating inconsistency in a tri-dexel model and reconstructing a water-tight polyhedr...

متن کامل

Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction

Given a triangulation T of n points in the plane, we are interested in the minimal set of edges in T such that T can be reconstructed from this set (and the vertices of T ) using constrained Delaunay triangulation. We show that this minimal set consists of the non locally Delaunay edges of T , and that its cardinality is less than or equal to n+ i=2 (if i is the number of interior points in T )...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer-Aided Design

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2015