Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Marching cube

Marching Cubes A High Resolution 3D Surface Construction Algorithm, Computer Graphics 21(4), pp 163-169 (1987)... [Pg.497]

Figure 24. Fourteen cases of the polygonal approximation for the isosurface inside a cube used by the marching cube algorithm [211]. Figure 24. Fourteen cases of the polygonal approximation for the isosurface inside a cube used by the marching cube algorithm [211].
Another semiempirical PCM formulation has been presented by Rauhut et al. (1993). They use a marching-cube algorithm to define tesserae (Lorensen and Cline, 1987). The flat mesh thus obtained is then projected on a van der Waals surface (factor Z =1.15). These authors point out that the full NDDO (Neglect of Diatomic Differential Overlap) expression of the (xm VBf xJ elements is convenient in order to have good results, when combined with the original PCM procedure for the surface charge renormalization. [Pg.56]

The marching-cube algorithm has been used also by Kolle and Jug (1995) to define the tesserae of isodensity surfaces. The procedure is implemented in the semiempirical SINDOl program (INDO with Slater-type orbitals, Li et al., 1992). To compute AS charges the asymptotic density model ADM (Koster et al., 1993) is used. This is an approximation to the calculation of molecular electrostatic potentials based on the cumulative atomic multipole moment procedure (CAMM, Sokalski et al., 1992). [Pg.56]

FOUE FOUE program for conversion of GSAS binary Fourier Map files to other formats, Scott Belmonte (2000) Converts GSAS binary Fourier Map files into ASCII DUMP, WinGX and Marching Cubes/ Crystals format files... [Pg.549]

MCE-Marching Cubes http //www.vscht.cz/min/mce MCGRtof E-mail Matt Tucker at m.g.tucker rl.ac.uk McMaille http //sdpd.univ-lemans.fr/McMaille/... [Pg.566]

W. E. Lorensen and H. E. Cline. 1987. Marching cubes A high resolution 3-D surface construction algorithm. ACM Computer Graphics 21(4) 163-169. [Pg.571]

Figure 20.1 Schematic of LSCM. A stack of 2D images is recorded at different focal planes in the specimen and subsequently reconstructed in three dimensions using the marching cubes algorithm [136], See insert for the color representation of the figure.)... Figure 20.1 Schematic of LSCM. A stack of 2D images is recorded at different focal planes in the specimen and subsequently reconstructed in three dimensions using the marching cubes algorithm [136], See insert for the color representation of the figure.)...
FIGURE 29.6 (a) Principle of the marching cubes algorithm indexes for the marching cube and (ft) coding scheme. (Reproduced with permission from Ref. 10.)... [Pg.753]

Lorensen, W. E., and H. E. Cline, Marching Cubes a high resolution 3D surface reconstruction algorithm, Computer Graphics, 1987,21 163-169. [Pg.778]

Lorensen W, Cline HE (1987) Marching cubes a high resolution 3D surface construction algorithm. Computer Graphics (SIGGRAPH 87 Proceedings) 21 163-170... [Pg.54]

The marching-cube algorithm works on a 3D mask that defines the object of interest obtained by a threshold-based or a more complex segmen-... [Pg.73]

When the marching cube algorithm is used on 3D data, a cube will move across the 3D data set, and the table will contain 256 possible configurations. The result of the marching cube algorithm will be a smoothed surface that will be visualized. [Pg.74]

When the surface is defined by triangulation or marching-cube algorithms, the following step serves to remove hidden surfaces. This means that, for the chosen point-of-view, the background triangles must be removed. This task is accomplished by a depth-sort algorithm. [Pg.74]

Pieta composed of 14M triangle mesh generated from more than 700 scans (Bernardini et al., 1999), reconstruction of "Pisa Cathedral" (Pisa, Italy) from laser scans with over 154M samples (Cuccuru et al., 2009), and head and cerebral structures (hidden) extracted from 150 MRI slices using the marching cubes algorithm (about 150,000 triangles), as shown in Fig. 3. [Pg.164]

V. I. Lesk and M. J. Sternberg, Bioinformatics, 24,1137-1144 (2008). 3D-Garden A System for Modelling Protein-Protein Complexes Based on Conformational Refinement of Ensembles Generated with the Marching Cubes Algorithm. [Pg.172]

Laser scaiming confocal microscopy Marching cubes algorithm Number of pixels along the edge of the image Number of projections in CT Coordination number at a junction Numerical aperture of an objective... [Pg.117]

X-Y plane and was modeled according to the marching cubes algorithm (MCA). Figures 6(c) and 6(d) show the surface-rendered 3D images of the SI block copolymer corresponding to those displayed in Figures 6(a) and 6(b),... [Pg.532]


See other pages where Marching cube is mentioned: [Pg.495]    [Pg.194]    [Pg.223]    [Pg.541]    [Pg.174]    [Pg.54]    [Pg.54]    [Pg.418]    [Pg.376]    [Pg.403]    [Pg.404]    [Pg.404]    [Pg.753]    [Pg.46]    [Pg.73]    [Pg.95]    [Pg.47]    [Pg.134]    [Pg.163]    [Pg.1687]    [Pg.2585]    [Pg.125]   
See also in sourсe #XX -- [ Pg.46 , Pg.73 ]




SEARCH



Algorithms marching cubes

Cubing

March

Marching

© 2024 chempedia.info