458 search results - page 56 / 92 » Distance graphs: from random geometric graphs to Bernoulli g... |
COMPGEOM
1990
ACM
14 years 21 days ago
1990
ACM
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...
PAMI
2007
13 years 8 months ago
2007
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...
CCCG
2009
13 years 9 months ago
2009
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...
TVCG
2011
13 years 3 months ago
2011
—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...
DCG
2010
13 years 8 months ago
2010
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...