SGP16: Eurographics Symposium on Geometry Processing (CGF 35-5)https://dlold.eg.org:443/handle/10.2312/26314272024-09-18T19:29:10Z2024-09-18T19:29:10ZDeep Learning for Robust Normal Estimation in Unstructured Point CloudsBoulch, AlexandreMarlet, Renaudhttps://dlold.eg.org:443/handle/10.1111/cgf129832022-03-28T09:40:32Z2016-01-01T00:00:00ZDeep Learning for Robust Normal Estimation in Unstructured Point Clouds
Boulch, Alexandre; Marlet, Renaud
Maks Ovsjanikov and Daniele Panozzo
Normal estimation in point clouds is a crucial first step for numerous algorithms, from surface reconstruction and scene understanding to rendering. A recurrent issue when estimating normals is to make appropriate decisions close to sharp features, not to smooth edges, or when the sampling density is not uniform, to prevent bias. Rather than resorting to manually-designed geometric priors, we propose to learn how to make these decisions, using ground-truth data made from synthetic scenes. For this, we project a discretized Hough space representing normal directions onto a structure amenable to deep learning. The resulting normal estimation method outperforms most of the time the state of the art regarding robustness to outliers, to noise and to point density variation, in the presence of sharp edges, while remaining fast, scaling up to millions of points.
2016-01-01T00:00:00ZMesh Statistics for Robust Curvature EstimationVáša, LiborVaněček, PetrPrantl, MartinSkorkovská, VěraMartínek, PetrKolingerová, Ivanahttps://dlold.eg.org:443/handle/10.1111/cgf129822022-03-28T09:39:59Z2016-01-01T00:00:00ZMesh Statistics for Robust Curvature Estimation
Váša, Libor; Vaněček, Petr; Prantl, Martin; Skorkovská, Věra; Martínek, Petr; Kolingerová, Ivana
Maks Ovsjanikov and Daniele Panozzo
While it is usually not difficult to compute principal curvatures of a smooth surface of sufficient differentiability, it is a rather difficult task when only a polygonal approximation of the surface is available, because of the inherent ambiguity of such representation. A number of different approaches has been proposed in the past that tackle this problem using various techniques. Most papers tend to focus on a particular method, while an comprehensive comparison of the different approaches is usually missing. We present results of a large experiment, involving both common and recently proposed curvature estimation techniques, applied to triangle meshes of varying properties. It turns out that none of the approaches provides reliable results under all circumstances. Motivated by this observation, we investigate mesh statistics, which can be computed from vertex positions and mesh connectivity information only, and which can help in deciding which estimator will work best for a particular case. Finally, we propose a meta-estimator, which makes a choice between existing algorithms based on the value of the mesh statistics, and we demonstrate that such meta-estimator, despite its simplicity, provides considerably more robust results than any existing approach.
2016-01-01T00:00:00ZDisk Density Tuning of a Maximal Random PackingEbeida, Mohamed S.Rushdi, Ahmad A.Awad, Muhammad A.Mahmoud, Ahmed H.Yan, Dong-MingEnglish, Shawn A.Owens, John D.Bajaj, Chandrajit L.Mitchell, Scott A.https://dlold.eg.org:443/handle/10.1111/cgf129812022-03-28T09:40:04Z2016-01-01T00:00:00ZDisk Density Tuning of a Maximal Random Packing
Ebeida, Mohamed S.; Rushdi, Ahmad A.; Awad, Muhammad A.; Mahmoud, Ahmed H.; Yan, Dong-Ming; English, Shawn A.; Owens, John D.; Bajaj, Chandrajit L.; Mitchell, Scott A.
Maks Ovsjanikov and Daniele Panozzo
We introduce an algorithmic framework for tuning the spatial density of disks in a maximal random packing, without changing the sizing function or radii of disks. Starting from any maximal random packing such as a Maximal Poisson-disk Sampling (MPS), we iteratively relocate, inject (add), or eject (remove) disks, using a set of three successively more-aggressive local operations. We may achieve a user-defined density, either more dense or more sparse, almost up to the theoretical structured limits. The tuned samples are conflict-free, retain coverage maximality, and, except in the extremes, retain the blue noise randomness properties of the input. We change the density of the packing one disk at a time, maintaining the minimum disk separation distance and the maximum domain coverage distance required of any maximal packing. These properties are local, and we can handle spatially-varying sizing functions. Using fewer points to satisfy a sizing function improves the efficiency of some applications. We apply the framework to improve the quality of meshes, removing non-obtuse angles; and to more accurately model fiber reinforced polymers for elastic and failure simulations.
2016-01-01T00:00:00ZExploration of Empty Space among Spherical Obstacles via Additively Weighted Voronoi DiagramManak, Martinhttps://dlold.eg.org:443/handle/10.1111/cgf129802022-03-28T09:40:09Z2016-01-01T00:00:00ZExploration of Empty Space among Spherical Obstacles via Additively Weighted Voronoi Diagram
Manak, Martin
Maks Ovsjanikov and Daniele Panozzo
Properties of granular materials or molecular structures are often studied on a simple geometric model - a set of 3D balls. If the balls simultaneously change in size by a constant speed, topological properties of the empty space outside all these balls may also change. Capturing the changes and their subsequent classification may reveal useful information about the model. This has already been solved for balls of the same size, but only an approximate solution has been reported for balls of different sizes. These solutions work on simplicial complexes derived from the dual structure of the ordinary Voronoi diagram of ball centers and use the mathematical concept of simplicial homology groups. If the balls have different radii, it is more appropriate to use the additively weighted Voronoi diagram (also known as the Apollonius diagram) instead of the ordinary diagram, but the dual structure is no longer a simplicial complex, so the previous approaches cannot be used directly. In this paper, a method is proposed to overcome this problem. The method works with Voronoi edges and vertices instead of the dual structure. Additional bridge edges are introduced to overcome disconnected cases. The output is a tree graph of events where cavities are created or merged during a simulated shrinking of the balls. This graph is then reorganized and filtered according to some criteria to get a more concise information about the development of the empty space in the model.
2016-01-01T00:00:00Z