Pierre-Jean Laurent

Learn More
We apply the Fast Marching Method on triangulated domains to eeciently compute Voronoi diagrams and ooset curves on triangulated manifolds. The computational complexity of the proposed algorithm is optimal, O(M log M), where M is the number of vertices. The algorithm also applies to weighted domains in which a diierent cost is assigned to each surface(More)
  • 1