5128 search results - page 611 / 1026 » Discrete Component Analysis |
165
click to vote
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
181
Voted
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
172
Voted
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
161
click to vote
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
176
click to vote
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...