90 search results - page 7 / 18 » Stipple Placement using Distance in a Weighted Graph |
141
click to vote
DCG
2010
14 years 11 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...
113
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
119
click to vote
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
116
click to vote
CG
2004
Springer
14 years 11 months ago
2004
Springer
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
SAC
2009
ACM
15 years 6 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...