The distance function is a solution to a type of Eikonal equation. The fastest O(n) method for numerically solving Eikonal equations was introduced by H. Zhao in his 2005 paper called the Fast Sweeping Method.
Tag Archives: #stanford
AABB Tree
When a sampling point is located near some part of a mesh, it is utterly useless to compute distances to triangles that are “on the other side” of the mesh. One might think that the concept of “closeness” to some triangles of the mesh is inseparable from the distance we intend to compute, but it turns out that there is another set of approaches utilizing a “friend” of programmers who want to accelerate a process handling arbitrarily large amounts of data – a binary tree
Martin Cavarga 