Name
Abstract | ||
|---|---|---|
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (triangles) from complex tessellated CAD models. Such optimizations are required to achieve interactive frame rates for the visual exploration of huge data sets on graphics workstations. Our algorithm is subdivided into three stages. At the rst step the the tesselated object is rendered with OpenGL from various camera positions to detect visible triangles very fast. A hardware-accelerated hemicube test is applied as the second stage, marking all triangles that can directly exchange energy with an innitely distant environment. Finally, a Monte Carlo ray tracing pass is applied to each remaining triangle, sampling its visibility with arbitrary accuracy. All invisible triangles are completely removed from the mesh. It is therefore not necessary to store visibility information, allowing the reduced mesh to be processed and displayed by any software. |
Year | Venue | Keywords |
|---|---|---|
2004 | IMR | cad,industrial application,mesh simplication,complex meshes,visibility testing,monte carlo,potentially visible set,hardware accelerator,ray tracing,convex hull |
Field | DocType | Citations |
Polygon mesh,Computer graphics (images),Mathematics | Conference | 0 |
PageRank | References | Authors |
0.34 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manfred Ernst | 1 | 144 | 8.12 |
| Frank Firsching | 2 | 0 | 0.68 |
| Roberto Grosso | 3 | 124 | 15.72 |