activity
20182022
most citedA Survey of Algorithms for Geodesic Paths and Distances

34 citations · 35 across the 3 of their papers we have counts for

collaborators

6 papers

cs.GR2022

Grid-Free Monte Carlo for PDEs with Spatially Varying Coefficients

Rohan Sawhney, Dario Seyb, Wojciech Jarosz +1

Partial differential equations (PDEs) with spatially-varying coefficients arise throughout science and engineering, modeling rich heterogeneous material behavior. Yet conventional…

cs.GR2021

Repulsive Surfaces

Chris Yu, Caleb Brakensiek, Henrik Schumacher +1

Functionals that penalize bending or stretching of a surface play a key role in geometric and scientific computing, but to date have ignored a very basic requirement: in many situa…

cs.GR2021

Integer Coordinates for Intrinsic Geometry Processing

Mark Gillespie, Nicholas Sharp, Keenan Crane

In this work, we present a general, efficient, and provably robust representation for intrinsic triangulations. These triangulations have emerged as a powerful tool for robust geom…

cs.GR202034 cited

A Survey of Algorithms for Geodesic Paths and Distances

Keenan Crane, Marco Livesu, Enrico Puppo +1

Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry…

cs.GR20201 cited

Repulsive Curves

Christopher Yu, Henrik Schumacher, Keenan Crane

Curves play a fundamental role across computer graphics, physical simulation, and mathematical visualization, yet most tools for curve design do nothing to prevent crossings or sel…

cs.GR2018

The Vector Heat Method

Nicholas Sharp, Yousuf Soliman, Keenan Crane

This paper describes a method for efficiently computing parallel transport of tangent vectors on curved surfaces, or more generally, any vector-valued data on a curved manifold. Mo…