全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Classification of Affine Local Vertex Curvature Functions with a Constant-Sum Law on Polygon Triangulations

DOI: 10.4236/apm.2026.1610038, PP. 785-795

Keywords: Discrete Gauss-Bonnet, Combinatorial Curvature, Outerplanar Graphs, Polygon Triangulation, Ear Clipping

Full-Text   Cite this paper   Add to My Lib

Abstract:

This paper presents a complete classification of affine local vertex curvature functions on triangulated polygonal disks, that is, on simple 2-cell plane triangulations whose outer boundary is a simple cycle, whose total vertex curvature takes one and the same value on every member of that class. We study local expressions of the form K( v )=?A+?Bdeg( v )+?C ∑ f?v 1 | f | +?T 1 { v∈?G } . Summing over all vertices and applying Euler and incidence relations reduces the total to an affine function of the global counts V and L. The total is independent of V, L and the particular triangulation if and only if A + 6B + 2C = 0 and T = 2B + C, in which case the invariant is ?6B ? C. Necessity uses the fact that V and L vary independently inside this class, which is established here by a stellar-subdivision construction; on the subclass of polygon triangulations without interior vertices one has L = V, and the two conditions are then sufficient but not separately necessary. Higuchi’s combinatorial curvature appears as a special case. A further specialization gives uniform curvature 1/n on every vertex of a convex n-gon. Randomized ear-clipping and stellar-subdivision triangulations, run as an implementation check of the counting identity, reproduce the predicted constants exactly in rational arithmetic and to within 5 × 10?15 in double precision. The result provides a compact local-to-global classification for discrete curvature on triangulated polygonal disks.

References

[1]  do Carmo, M.P. (1976) Differential Geometry of Curves and Surfaces. Prentice Hall.
[2]  Bobenko, A.I. and Suris, Y.B. (2008) Discrete Differential Geometry: Integrable Structure. Springer.
[3]  Higuchi, Y. (2001) Combinatorial Curvature for Planar Graphs. Journal of Graph Theory, 38, 220-229.
https://doi.org/10.1002/jgt.10004
[4]  Knill, O. (2011) A Graph Theoretical Gauss-Bonnet-Chern Theorem.
https://people.math.harvard.edu/~knill/graphgeometry/papers/2.pdf
[5]  Meyer, M., Desbrun, M., Schr?der, P. and Barr, A.H. (2003) Discrete Differential-Geometry Operators for Triangulated 2-Manifolds. In: Hege, H.-C. and Polthier, K., Eds., Visualization and Mathematics III, Springer, 35-57.
https://doi.org/10.1007/978-3-662-05105-4_2
[6]  West, D.B. (2001) Introduction to Graph Theory. 2nd Edition, Prentice Hall.
[7]  Diestel, R. (2017) Graph Theory. 5th Edition, Springer.
[8]  Meisters, G.H. (1975) Polygons Have Ears. The American Mathematical Monthly, 82, 648-651.
https://doi.org/10.1080/00029890.1975.11993898
[9]  O’Rourke, J. (1998) Computational Geometry in C. 2nd Edition, Cambridge University Press.
[10]  de Berg, M., Cheong, O., van Kreveld, M. and Overmars, M. (2008) Computational Geometry: Algorithms and Applications. 3rd Edition, Springer.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133