140 search results - page 18 / 28 » Computing the visibility graph of points within a polygon |
WADS
2007
Springer
15 years 5 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
We present confocal stereo, a new method for computing 3D shape by controlling the focus and aperture of a lens. The method is specifically designed for reconstructing scenes with ...
RT
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we introduce a real-time algorithm to render the rich visual effects of general non-height-field geometric details, known as mesostructure. Our method is based on ...
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
100
click to vote
SGP
2007
15 years 2 months ago
2007
A robust statistics approach to curvature estimation on discretely sampled surfaces, namely polygon meshes and point clouds, is presented. The method exhibits accuracy, stability ...