2003
DOI: 10.1007/978-3-662-05105-4_2
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Differential-Geometry Operators for Triangulated 2-Manifolds

Abstract: Summary. This paper proposes a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Voronoi cells and the mixed Finite-Element/Finite-Volume method, and compare them to existing formulations. Building upon previous work in discrete geometry, these operators are closely related to the continuous cas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
1,168
0
5

Year Published

2006
2006
2019
2019

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 1,466 publications
(1,216 citation statements)
references
References 21 publications
3
1,168
0
5
Order By: Relevance
“…a 9 : Mean curvature. We compute the mean curvature on the surface of the object using Meyer et al [2002]. We consider curvature magnitudes to be relevant (not generated by noise) if they could be generated by a feature larger than 1% of the object's size.…”
Section: Attributes Of Viewsmentioning
confidence: 99%
See 1 more Smart Citation
“…a 9 : Mean curvature. We compute the mean curvature on the surface of the object using Meyer et al [2002]. We consider curvature magnitudes to be relevant (not generated by noise) if they could be generated by a feature larger than 1% of the object's size.…”
Section: Attributes Of Viewsmentioning
confidence: 99%
“…For mesh saliency, we use the implementation of Lee et al [2005] to assign a value at every vertex as a preprocess. Similarly, we compute the mean and Gaussian curvatures of the surface using the method of Meyer et al [2002]. For any particular view we render a "color" buffer containing these values interpolated across faces and compute the appropriate quantities on the resulting rendered images.…”
Section: :4mentioning
confidence: 99%
“…The odd vertices were defined as a set of independent vertices which are not directly connected by an edge. All the selected odd vertices are removed by a mesh simplification algorithm in the global down-sampling stage, and then predicted back using the prediction operator that relax the curvature based on the Meyer smoothing operator [34,35].Szczensa proposed a new multi-resolution analysis for irregular meshes using the lifting scheme, in which she proposed a new prediction operator using Voronoi cells in a local neighbourhood [36,37].Very recently, the authors have proposed a lifting based algorithm to filter the texture on freeform surface, this technique consisted of five major operators; split, predict, update, simplify (down-sampling) and merge (upsampling) [16].…”
Section: -Multi-scales Analysis On Surfaces Represented By Triangulamentioning
confidence: 99%
“…It explains that Gaussian curvature can reflect the local bending degree of the local surface. We use following formula to estimate Gaussian curvature [7] .…”
Section: Interpolation Animation Realizationmentioning
confidence: 99%