Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...