Edge o set meshes in Laguerre geometry

Advances in Computational Mathematics

引用 24|浏览4
暂无评分
摘要
A meshM with planar faces is called an edge o set (EO) mesh if there exists a combinatorially equivalent meshM d such that corresponding edges of M and M d lie on parallel lines of constant distance d. The edges emanating from a vertex of M lie on a right circular cone. Viewing M as set of these vertex cones, we show that the image ofM under any Laguerre transformation is again an EO mesh. As a generalization of this result, it is proved that the cyclographic mapping transforms any EO mesh in a hyperplane of Minkowksi 4-space into a pair of Euclidean EO meshes. This result leads to a derivation of EO meshes which are discrete versions of Laguerre minimal surfaces. Laguerre minimal EO meshes can also be constructed directly from certain pairs of Koebe meshes with help of a discrete Laguerre geometric counterpart of the classical Christo el duality.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要