You can find geodesic paths in triangle meshes by just flipping edges

N Sharp, K Crane - ACM Transactions on Graphics (TOG), 2020 - dl.acm.org
This paper introduces a new approach to computing geodesics on polyhedral surfaces---the
basic idea is to iteratively perform edge flips, in the same spirit as the classic Delaunay flip …

geoTangle: Interactive Design of Geodesic Tangle Patterns on Surfaces

G Nazzaro, E Puppo, F Pellacini - ACM Transactions on Graphics (TOG), 2021 - dl.acm.org
Tangles are complex patterns, which are often used to decorate the surface of real-world
artisanal objects. They consist of arrangements of simple shapes organized into nested …

Geometry processing with intrinsic triangulations

N Sharp, M Gillespie, K Crane - SIGGRAPH'21: ACM SIGGRAPH 2021 …, 2021 - par.nsf.gov
This course provides a first introduction to intrinsic triangulations and their use in mesh
processing algorithms. As geometric data becomes more ubiquitous, eg, in applications …

Geodesic distance computation via virtual source propagation

P Trettner, D Bommes, L Kobbelt - Computer graphics forum, 2021 - Wiley Online Library
We present a highly practical, efficient, and versatile approach for computing approximate
geodesic distances. The method is designed to operate on triangle meshes and a set of …

An accuracy controllable and memory efficient method for computing high-quality geodesic distances on triangle meshes

YY Adikusuma, J Du, Z Fang, Y He - Computer-Aided Design, 2022 - Elsevier
This paper presents a new method for computing approximate geodesic distances and
paths on triangle meshes. Our method combines two state-of-the-art discrete geodesic …

Geodesic tracks: Computing discrete geodesics with track-based steiner point propagation

W Meng, S Xin, C Tu, S Chen, Y He… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
This article presents a simple yet effective method for computing geodesic distances on
triangle meshes. Unlike the popular window propagation methods that partition mesh edges …

[PDF][PDF] Intrinsic Triangulations in Geometry Processing.

N Sharp - 2021 - kilthub.cmu.edu
This thesis treats the theory and practice of intrinsic triangulations, and their use in 3D mesh
processing algorithms. As geometric data becomes more ubiquitous in applications ranging …

Wrinkle and curl distortion of leaves using plant dynamic

X Sun, J Fu, T Chen, Y Dong - Graphical Models, 2021 - Elsevier
An algorithm was proposed to simulate the withering deformation of plant leaves by wrinkle
and curl due to dehydration, based on cell dynamics and time-varying external force. First, a …

On the vertex-oriented triangle propagation (VTP) algorithm: Parallelization and approximation

J Du, Y He, Z Fang, W Meng, SQ Xin - Computer-Aided Design, 2021 - Elsevier
Computing geodesic distances on polyhedral surfaces is a fundamental problem in digital
geometry processing and computer-aided design. Most of the existing exact algorithms …

Craniofacial reconstruction based on geodesic regression model

Z Chen, J Zhao, H Yu, Z Pan, B Jia, J Li - Journal of Computer-Aided Design …, 2021 - jcad.cn
Craniofacial reconstruction refers to predicting the corresponding appearance based on the
characteristics of an unknown skull. In order to solve the problem of large amount of data …