An improved version of the "marching cubes" algorithm [W. Lorensen and H. Cline, Comp. Graph. 21, (198711 for the generation of isosurfaces from 3D data fields is presented and applied to molecular surfaces. The new algorithm avoids inconsistent pattern definitions of the original one, which lead to
✦ LIBER ✦
GENERALIZED 3-D PAVING: AN AUTOMATED QUADRILATERAL SURFACE MESH GENERATION ALGORITHM
✍ Scribed by R. J. CASS; S. E. BENZLEY; R. J. MEYERS; T. D. BLACKER
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 747 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
✦ Synopsis
This paper discusses the extension of the paving algorithm for all quadrilateral mesh generation to arbitrary three-dimensional trimmed surfaces. Methods of calculating angles, projecting elements, and detecting collisions between paving boundaries, for general surfaces are presented. Extensions of the smoothing algorithms for three dimensions are set forth. Advances in the use of scalar sizing functions are presented. These functions can be used to better approximate internal mesh density from boundary densities and surface characteristics.
📜 SIMILAR VOLUMES
Fast generation of molecular surfaces fr
Fast generation of molecular surfaces from 3D data fields with an enhanced “marching cube” algorithm
✍
W. Heiden; T. Goetze; J. Brickmann
📂
Article
📅
1993
🏛
John Wiley and Sons
🌐
English
⚖ 516 KB