2621 search results - page 252 / 525 » Near orders and codes |
163
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
195
click to vote
GRAPHICSINTERFACE
2000
15 years 8 months ago
2000
We introduce an algorithm for high-quality, interactive light field rendering from only a small number of input images with dense depth information. The algorithm bridges the gap ...
184
click to vote
COMAD
1994
15 years 8 months ago
1994
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
209
click to vote
AIPS
2009
15 years 7 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
197
click to vote
APVIS
2009
15 years 7 months ago
2009
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...