3025 search results - page 369 / 605 » Computational geometry: a retrospective |
143
click to vote
COMPGEOM
2003
ACM
16 years 3 days ago
2003
ACM
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
161
click to vote
COMPGEOM
2010
ACM
15 years 12 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...
287
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...
214
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...
174
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 ...