92 research outputs found

    A discrete Laplace-Beltrami operator for simplicial surfaces

    Get PDF
    We define a discrete Laplace-Beltrami operator for simplicial surfaces. It depends only on the intrinsic geometry of the surface and its edge weights are positive. Our Laplace operator is similar to the well known finite-elements Laplacian (the so called ``cotan formula'') except that it is based on the intrinsic Delaunay triangulation of the simplicial surface. This leads to new definitions of discrete harmonic functions, discrete mean curvature, and discrete minimal surfaces. The definition of the discrete Laplace-Beltrami operator depends on the existence and uniqueness of Delaunay tessellations in piecewise flat surfaces. While the existence is known, we prove the uniqueness. Using Rippa's Theorem we show that, as claimed, Musin's harmonic index provides an optimality criterion for Delaunay triangulations, and this can be used to prove that the edge flipping algorithm terminates also in the setting of piecewise flat surfaces.Comment: 18 pages, 6 vector graphics figures. v2: Section 2 on Delaunay triangulations of piecewise flat surfaces revised and expanded. References added. Some minor changes, typos corrected. v3: fixed inaccuracies in discussion of flip algorithm, corrected attributions, added references, some minor revision to improve expositio

    Weighted Triangulations for Geometry Processing

    Get PDF
    In this article we investigate the use of weighted triangulations as discrete, augmented approximations of surfaces for digital geometry processing. By incorporating a scalar weight per mesh vertex, we introduce a new notion of discrete metric that defines an orthogonal dual structure for arbitrary triangle meshes and thus extends weighted Delaunay triangulations to surface meshes. We also present alternative characterizations of this primal-dual structure (through combinations of angles, areas, and lengths) and, in the process, uncover closed-form expressions of mesh energies that were previously known in implicit form only. Finally, we demonstrate how weighted triangulations provide a faster and more robust approach to a series of geometry processing applications, including the generation of well-centered meshes, self-supporting surfaces, and sphere packing

    Combinatorial α\alpha-curvatures and α\alpha-flows on polyhedral surfaces, I

    Full text link
    We introduce combinatorial α\alpha-curvature for piecewise linear metrics on polyhedral surfaces, which is a generalization of the classical combinatorial curvature on polyhedral surfaces. Then we prove the global rigidity of α\alpha-curvature with respect to the discrete conformal factors. To study the corresponding Yamabe problem of α\alpha-curvature, we introduce the combinatorial α\alpha-Yamabe flow and combinatorial α\alpha-Calabi flow for piecewise linear metrics on surfaces. To handle the possible singularities along the flows, we do surgery on the flows by flipping. Then we prove that if αχ(S)≤0\alpha\chi(S)\leq 0, there exists a piecewise linear metric with constant combinatorial α\alpha-curvature on a polyhedral surface SS, which is a parameterized generalization of Gu-Luo-Sun-Wu's discrete uniformization theorem. We further prove that the combinatorial α\alpha-Yamabe flow and α\alpha-Calabi flow with surgery exists for all time and converges to a piecewise linear metric with constant combinatorial α\alpha-curvature for any initial piecewise linear metric if αχ(S)≤0\alpha\chi(S)\leq 0.Comment: arXiv admin note: text overlap with arXiv:1806.0216
    • …
    corecore