2980 search results - page 386 / 596 » Computational Geometry |
158
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
271
click to vote
VISUALIZATION
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
200
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
We present a robust approach to creating 2.5D building models from aerial LiDAR point clouds. The method is guaranteed to produce crack-free models composed of complex roofs and ve...
168
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
140
click to vote
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We have assembled a standalone, movable system that can capture long sequences of omnidirectional images (up to 1,500 images at 6.7 Hz and a resolution of 1140 × 1030). The goal ...