AbstractWe present an algorithm capable of reconstructing a non-manifold surface embedded as a point cloud in a high-dimensional space. Our algorithm extends a previously developed incremental method and produces a non-optimal triangulation, but will work for non-orientable surfaces, and for surfaces with certain types of self-intersection. The self-intersections must be ordinary double curves and are fitted locally by intersecting planes using a degenerate quadratic surface. We present the algorithm in detail and provide many examples, including a dataset describing molecular conformations of cyclo-octane
We survey and benchmark traditional and novel learning-based algorithms that address the problem of ...
We present an automatic method for the generation of surface triangulations from sets of scattered p...
By extending the work published at ICCS 2021 Zhu et al. (2021), in this paper we propose a new metho...
AbstractWe present an algorithm capable of reconstructing a non-manifold surface embedded as a point...
We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud da...
AbstractA new algorithm is presented for surface reconstruction from unorganized points. Unlike many...
We present an algorithm and its implementation to reconstruct a complex composed of surfaces from an...
We present a novel surface model and reconstruction method for man-made environments that take prior...
Today, polygonal models occur everywhere in graphical applications, since they are easy to render a...
Abstract — In this paper we present a method for fast surface reconstruction from large noisy datase...
We present a method for extracting complex manifolds with an arbitrary number of (self-) intersectio...
We present an algorithm for creating a CAD model of an existing physical object from a scanned point...
The problem of generating a surface triangulation from a set of points with normal information arise...
We present a new approach for reconstructing a smooth surface from a set of scattered points in thre...
This thesis addresses the problem of constructing virtual representations of surfaces only known as ...
We survey and benchmark traditional and novel learning-based algorithms that address the problem of ...
We present an automatic method for the generation of surface triangulations from sets of scattered p...
By extending the work published at ICCS 2021 Zhu et al. (2021), in this paper we propose a new metho...
AbstractWe present an algorithm capable of reconstructing a non-manifold surface embedded as a point...
We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud da...
AbstractA new algorithm is presented for surface reconstruction from unorganized points. Unlike many...
We present an algorithm and its implementation to reconstruct a complex composed of surfaces from an...
We present a novel surface model and reconstruction method for man-made environments that take prior...
Today, polygonal models occur everywhere in graphical applications, since they are easy to render a...
Abstract — In this paper we present a method for fast surface reconstruction from large noisy datase...
We present a method for extracting complex manifolds with an arbitrary number of (self-) intersectio...
We present an algorithm for creating a CAD model of an existing physical object from a scanned point...
The problem of generating a surface triangulation from a set of points with normal information arise...
We present a new approach for reconstructing a smooth surface from a set of scattered points in thre...
This thesis addresses the problem of constructing virtual representations of surfaces only known as ...
We survey and benchmark traditional and novel learning-based algorithms that address the problem of ...
We present an automatic method for the generation of surface triangulations from sets of scattered p...
By extending the work published at ICCS 2021 Zhu et al. (2021), in this paper we propose a new metho...