216 citations · 675 across the 26 of their papers we have counts for
Showing 2013 · cs.CGShow all
2 papers · 2 filters
cs.CG2013★ 40 cited
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph
Pegah Kamousi, Sylvain Lazard, Anil Maheshwari +1
A standard way to approximate the distance between any two vertices and on a mesh is to compute, in the associated graph, a shortest path from to that goes through…
cs.CG2013
The Complexity of Order Type Isomorphism
Greg Aloupis, John Iacono, Stefan Langerman +1
The order type of a point set in maps each -tuple of points to its orientation (e.g., clockwise or counterclockwise in ). Two point sets and have the sa…