This paper presents the Saddle Vertex Graph (SVG), a novel solution to the discrete
geodesic problem. The SVG is a sparse undirected graph that encodes complete geodesic …

In this paper, we deal with the problem of computing the distance to a surface (a curve in two
dimensional) and consider several distance function approximation methods which are …

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

In many graphics applications, the computation of exact geodesic distance is very important.
However, the high computational cost of existing geodesic algorithms means that they are …

Varied cluster analysis were applied to facial surface measurements from 62 prepubertal
boys with essential autism to determine whether facial morphology constitutes viable …

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 …

This paper presents keyframe-based geometry video (KGV), a novel framework for
compressing 3-D human motion data by using geometry videos. Given a motion data …

Computing geodesic distances on polyhedral surfaces is an important task in digital
geometry processing. Speed and accuracy are two commonly-used measurements of …

This paper proposes a deep-learning-based method for recovering a signed distance
function (SDF) of a given hypersurface represented by an implicit level set function. Using …