Sciweavers

102 search results - page 9 / 21
» Computing bounding volume hierarchies using model simplifica...
Sort
View
CGI
1998
IEEE
13 years 11 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
SMA
2008
ACM
155views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Filament tracking and encoding for complex biological networks
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...
David Mayerich, John Keyser
CG
2011
Springer
12 years 11 months ago
Feature based volumes for implicit intersections
The automatic generation of volumes bounding the intersection of two implicit surfaces (isosurfaces of real functions of 3D point coordinates) or Feature Based Volumes (FBV) is pr...
Oleg Fryazinov, Pierre-Alain Fayolle, Turlif Vilbr...
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 7 months ago
Conservative swept volume boundary approximation
We present a novel technique for approximating the boundary of a swept volume. The generator given by an input triangle mesh is rendered under all rigid transformations of a discr...
Andreas von Dziegielewski, R. Erbes, Elmar Sch&oum...
SIGGRAPH
2009
ACM
14 years 2 months ago
PCCD: parallel continuous collision detection
We present a novel parallel continuous collision detection (PCCD) method to utilize the widely available multi-core CPU architecture. Our method works with a wide variety of defor...
Duksu Kim, Jae-Pil Heo, Sung-Eui Yoon