Simplification of Multi-Scale Geometry using Adaptive Curvature Fields

10/24/2016
by   Patrick Seemann, et al.
0

We present a novel algorithm to compute multi-scale curvature fields on triangle meshes. Our algorithm is based on finding robust mean curvatures using the ball neighborhood, where the radius of a ball corresponds to the scale of the features. The essential problem is to find a good radius for each ball to obtain a reliable curvature estimation. We propose an algorithm that finds suitable radii in an automatic way. In particular, our algorithm is applicable to meshes produced by image-based reconstruction systems. These meshes often contain geometric features at various scales, for example if certain regions have been captured in greater detail. We also show how such a multi-scale curvature field can be converted to a density field and used to guide applications like mesh simplification.

READ FULL TEXT

page 1

page 6

page 7

research
05/22/2023

Estimating Discrete Total Curvature with Per Triangle Normal Variation

We introduce a novel approach for measuring the total curvature at every...
research
03/20/2020

Gaussian Curvature Filter on 3D Mesh

Minimizing Gaussian curvature of meshes is fundamentally important for o...
research
07/30/2022

Bump hunting through density curvature features

Bump hunting deals with finding in sample spaces meaningful data subsets...
research
10/04/2017

Characterization of Multi-scale Invariant Random Fields

Applying certain flexible geometric sampling of a multi-scale invariant ...
research
08/07/2017

An Approach to Quad Meshing Based on Harmonic Cross-Valued Maps and the Ginzburg-Landau Theory

A generalization of vector fields, referred to as N-direction fields or ...
research
04/20/2023

Neuro-OSVETA: A Robust Watermarking of 3D Meshes

Best and practical watermarking schemes for copyright protection of 3D m...

Please sign up or login with your details

Forgot password? Click here to reset