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
Physically-based methods for polygonization of implicit surfaces
Proceedings of the conference on Graphics interface '92
An implicit surface polygonizer
Graphics gems IV
Using particles to sample and control implicit surfaces
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A Generalization of Algebraic Surface Drawing
ACM Transactions on Graphics (TOG)
Introduction to Implicit Surfaces
Introduction to Implicit Surfaces
Subdivision-Curve Primitives: A New Solution for Interactive Implicit Modeling
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
| Hi-index | 0.00 |
This article presents an extension of classical marching cubes for implicit objects associated with blending control. In the framework of classical blend graph[Guy and Wyvill 1995], a technique for handling blending is presented, based on mostly boolean operations, and hence allowing efficient implementation. What is more, the resulting tesselation is topologically closer to the theoretical topology of the mathematical object considered than classical marching cubes tesselations. We also propose an optimization, that we call partial time stamping, that significantly diminishes the amount of redundant field values evaluation during marching cubes tesselation, and has the advantage of being compatible with blending control. This technique can be seen as the extension of an optimization technique described in [Triquet et al. 2001], that was not designed for blending control. Our technique is finally compared to classical marching cubes implementations, as a reference. In this final section it is shown that our technique permits high performance visualization of implicits objects combined with blending control.