English
Related papers

Related papers: Flat Delaunay Complexes for Homeomorphic Manifold …

200 papers

Reconstructing building wireframe from airborne LiDAR point clouds yields a compact, topology-centric representation that enables structural understanding beyond dense meshes. Yet a key limitation persists: conventional methods have failed…

Computer Vision and Pattern Recognition · Computer Science 2026-04-06 Donghyun Kim , Chanyoung Kim , Youngjoong Kwon , Seong Jae Hwang

We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on $\delta$-generic…

Computational Geometry · Computer Science 2013-03-27 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh

We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact…

Computational Geometry · Computer Science 2015-05-07 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh

We consider the problem of optimality in manifold reconstruction. A random sample $\mathbb{X}_n = \left\{X_1,\ldots,X_n\right\}\subset \mathbb{R}^D$ composed of points close to a $d$-dimensional submanifold $M$, with or without outliers…

Statistics Theory · Mathematics 2018-02-02 Eddie Aamari , Clément Levrard

In this paper we define, implement, and investigate a simplicial complex construction for computing persistent homology of Euclidean point cloud data, which we call the Delaunay-Rips complex (DR). Assigning the Vietoris-Rips weights to…

Computation · Statistics 2023-03-03 Amish Mishra , Francis C. Motta

The alpha complex efficiently computes persistent homology of a point cloud $X$ in Euclidean space when the dimension $d$ is low. Given a subset $A$ of $X$, relative persistent homology can be computed as the persistent homology of the…

Algebraic Topology · Mathematics 2019-11-19 Nello Blaser , Morten Brun

Often noisy point clouds are given as an approximation of a particular compact set of interest. A finite point cloud is a compact set. This paper proves a reconstruction theorem which gives a sufficient condition, as a bound on the…

Computational Geometry · Computer Science 2013-08-06 Katharine Turner

Point cloud completion seeks to recover geometrically consistent shapes from partial or sparse 3D observations. Although recent methods have achieved reasonable global shape reconstruction, they often rely on Euclidean proximity and…

Computer Vision and Pattern Recognition · Computer Science 2025-12-08 Jianan Sun , Dongzhihan Wang , Mingyu Fan

In this paper, we give the first algorithm that outputs a faithful reconstruction of a submanifold of Euclidean space without maintaining or even constructing complicated data structures such as Voronoi diagrams or Delaunay complexes. Our…

Computational Geometry · Computer Science 2017-08-08 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh , Steve Y. Oudot

We introduce a novel learning-based, visibility-aware, surface reconstruction method for large-scale, defect-laden point clouds. Our approach can cope with the scale and variety of point cloud defects encountered in real-life Multi-View…

Computer Vision and Pattern Recognition · Computer Science 2022-02-03 Raphael Sulzer , Loic Landrieu , Renaud Marlet , Bruno Vallet

Advanced representation learning techniques require reliable and general evaluation methods. Recently, several algorithms based on the common idea of geometric and topological analysis of a manifold approximated from the learned data…

Machine Learning · Computer Science 2022-02-15 Petra Poklukar , Vladislav Polianskii , Anastasia Varava , Florian Pokorny , Danica Kragic

3D point clouds are often perturbed by noise due to the inherent limitation of acquisition equipments, which obstructs downstream tasks such as surface reconstruction, rendering and so on. Previous works mostly infer the displacement of…

Computer Vision and Pattern Recognition · Computer Science 2020-08-11 Shitong Luo , Wei Hu

In this paper, we study the shape reconstruction problem, when the shape we wish to reconstruct is an orientable smooth d-dimensional submanifold of the Euclidean space. Assuming we have as input a simplicial complex K that approximates the…

Computational Geometry · Computer Science 2025-03-20 Dominique Attali , André Lieutier

Recovering high quality surfaces from noisy point clouds, known as point cloud denoising, is a fundamental yet challenging problem in geometry processing. Most of the existing methods either directly denoise the noisy input or filter raw…

Computer Vision and Pattern Recognition · Computer Science 2023-07-04 Zheng Liu , Yaowu Zhao , Sijing Zhan , Yuanyuan Liu , Renjie Chen , Ying He

In this paper, a novel learning-based network, named DeepDT, is proposed to reconstruct the surface from Delaunay triangulation of point cloud. DeepDT learns to predict inside/outside labels of Delaunay tetrahedrons directly from a point…

Computer Vision and Pattern Recognition · Computer Science 2021-04-02 Yiming Luo , Zhenxing Mi , Wenbing Tao

In this article we provide a general construction when $n\ge3$ for immersed in Euclidean $(n+1)$-space, complete, smooth, constant mean curvature hypersurfaces of finite topological type (in short CMC $n$-hypersurfaces). More precisely our…

Differential Geometry · Mathematics 2017-07-14 Christine Breiner , Nikolaos Kapouleas

We present a method for reconstructing triangle meshes from point clouds. Existing learning-based methods for mesh reconstruction mostly generate triangles individually, making it hard to create manifold meshes. We leverage the properties…

Computer Vision and Pattern Recognition · Computer Science 2021-05-07 Marie-Julie Rakotosaona , Paul Guerrero , Noam Aigerman , Niloy Mitra , Maks Ovsjanikov

The reconstruction of real-world surfaces is on high demand in various applications. Most existing reconstruction approaches apply 3D scanners for creating point clouds which are generally sparse and of low density. These points clouds will…

Computer Vision and Pattern Recognition · Computer Science 2021-03-01 Rajat Sharma , Tobias Schwandt , Christian Kunert , Steffen Urban , Wolfgang Broll

Reconstructing a high-resolution 3D model of an object is a challenging task in computer vision. Designing scalable and light-weight architectures is crucial while addressing this problem. Existing point-cloud based reconstruction…

Computer Vision and Pattern Recognition · Computer Science 2019-01-28 Priyanka Mandikal , R. Venkatesh Babu

3D point cloud - a new signal representation of volumetric objects - is a discrete collection of triples marking exterior object surface locations in 3D space. Conventional imperfect acquisition processes of 3D point cloud - e.g.,…

Computer Vision and Pattern Recognition · Computer Science 2019-05-01 Jin Zeng , Gene Cheung , Michael Ng , Jiahao Pang , Cheng Yang
‹ Prev 1 2 3 10 Next ›