Name
Abstract | ||
|---|---|---|
Recently, Katz et al. have shown how visibility information for a point cloud may be estimated by the so-called HPR operator. In a nutshell, the operator consists of a simple transformation of the cloud followed by a convex hull computation. Since convex hulls take $O(n \log n)$ time to compute in the worst case, this method has been considered impractical for real-time rendering of medium to large point clouds. In this paper, we describe a GPU implementation of an approximate convex-hull algorithm that runs in $O(n+k)$ time, where $k$ is a parameter of the method. Experiments show that the method is suitable for real-time rendering and partial reconstruction of point clouds with millions of points. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/SIBGRAPI.2012.26 | SIBGRAPI |
Keywords | Field | DocType |
kernel,surface reconstruction,approximation algorithms,topology,computational geometry,computational complexity | Parallel rendering,Computer science,3D rendering,Convex hull,Algorithm,Theoretical computer science,Rendering (computer graphics),Software rendering,Point cloud,Rendering equation,Tiled rendering | Conference |
Citations | PageRank | References |
1 | 0.35 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Renan Machado e Silva | 1 | 2 | 0.70 |
| Claudio Esperança | 2 | 13 | 4.79 |
| Antonio Oliveira | 3 | 6 | 2.54 |