1879 search results - page 244 / 376 » Computational geometry algorithms library |
137
Voted
COMPGEOM
2010
ACM
15 years 10 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...
158
click to vote
ECCV
2010
Springer
15 years 9 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...
144
Voted
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
158
click to vote
CAIP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper presents a new hybrid split-and-merge image segmentation method based on computational geometry and topology using persistent homology. The algorithm uses edge...
141
click to vote
TVCG
2008
15 years 4 months ago
2008
In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mes...