Ray tracing generalized cylinders
ACM Transactions on Graphics (TOG)
Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Polygonization of implicit surfaces
Computer Aided Geometric Design
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Solid representation and operation using extended octrees
ACM Transactions on Graphics (TOG)
A simple method for box-sphere intersection testing
Graphics gems
A surface-scanning algorithm for displaying generalized cylinders
The Visual Computer: International Journal of Computer Graphics
Computer algebra (2nd ed.): systems and algorithms for algebraic computation
Computer algebra (2nd ed.): systems and algorithms for algebraic computation
Real functions for representation of rigid solids
Computer Aided Geometric Design
Adaptively sampled distance fields: a general representation of shape for computer graphics
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
The sweep-envelope differrential equation algorithm for general deformed swept volumes
Computer Aided Geometric Design
On surface normal and Gaussian curvature approximations given data sampled from a smooth surface
Computer Aided Geometric Design
Introduction to Implicit Surfaces
Introduction to Implicit Surfaces
'Meshsweeper': Dynamic Point-to-Polygonal-Mesh Distance and Applications
IEEE Transactions on Visualization and Computer Graphics
Estimating the tensor of curvature of a surface from a polyhedral approximation
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
| Hi-index | 0.00 |
We present a new approach to approximately construct the envelope of a moving solid. It is based on dynamically updating an octree that approximates the envelope surface. Our approach guarantees a prescribed error-bound, and is scalable in the sense that it allows a very fast calculation of coarse approximations, while better approximations can be obtained by investing more computation time and memory. Furthermore, the algorithm is robust due to the fact that no badly conditioned surface-surface intersections have to be computed.