We present GEGNN, a learning-based method for computing the approximate geodesic
distance between two arbitrary points on discrete polyhedra surfaces with constant time …

The alternating direction method of multipliers (ADMM) is a popular approach for solving
optimization problems that are potentially non-smooth and with hard constraints. It has been …

The alternating direction multiplier method (ADMM) is widely used in computer graphics for
solving optimization problems that can be nonsmooth and nonconvex. It converges quickly …

We introduce a method for approximating the signed distance function (SDF) of geometry
corrupted by holes, noise, or self-intersections. The method implicitly defines a completed …

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 …

Finding distortion-minimizing homeomorphisms between surfaces of arbitrary genus is a
fundamental task in computer graphics and geometry processing. We propose a simple …

Geodesics play a critical role in many geometry processing applications. Traditional
algorithms for computing geodesics on 3D mesh models are often inefficient and slow …

The local barycentric coordinates (LBC), proposed in Zhang et al.(2014), demonstrate good
locality and can be used for local control on function value interpolation and shape …

Localization in underwater wireless sensor network (UWSN) faces an imminent threat when
the triangulating anchor node starts to malfunction. Traditional geometric approaches are …

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