Computing geodesic distances on triangle meshes is a fundamental problem in
computational geometry and computer graphics. To date, two notable classes of algorithms …

Computing discrete geodesics on polyhedral surfaces plays an important role in computer
graphics. In contrast to the well-studied" single-source, all-destination" discrete geodesic …

We present a new graph-based method, called discrete geodesic graph (DGG), to compute
discrete geodesics in a divide-and-conquer manner. Let M be a manifold triangle mesh with …

This paper develops a new method for constructing Discrete Geodesic Graph (DGG)—an
undirected, sparse graph for computing discrete geodesic distances and paths on triangle …

A novel filament winding virtual tool is proposed to develop the 3D winding paths on the
workpiece contour in real-time. The semi-geodesic and constant-wall-thickness (CWT) …

In the nuclear industry, the finishing grinding work of the nuclear reactor coolant pump
(RCP) casing is mainly performed manually. Uncontrollable grinding tasks cause the …

Abstract Fused Deposition Modeling is a worldwide diffused Additive Manufacturing
technology able to fabricate prototypes, tooling and end user parts directly from a virtual …

This paper studies the Voronoi diagrams on 2‐manifold meshes based on geodesic metric
(aka geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that …

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 …

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 …