A. GU EZIEC AND R. HUMMEL. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Trans. Visualization Comput. Graphics 1 (1995), 328--342. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Evaluation of Protein Docking Predictions Using Hex 3.1 in CAPRI.. - Ritchie (2002) (Correct)
....using a soft molecular mechanics energy minimisation procedure, and the list of docking solutions may be clustered to help identify distinct orientations and reduce the number of false positives . Additionally, protein surface shapes are now calculated using a new marching tetragons algorithm [12] to contour atomic Gaussian density representations [13] of each protein. This treats re entrant surface regions more reliably than our former dot surface sampling scheme [8] and allows improved graphical visualisation of results. To try to honour the spirit of a blind trial, and to test our ....
....contoured using enlarged atom radii. We define the surface skin as the volume bounded by the SAS and VDW surfaces. This skin volume is central to our model of protein shape complementarity [8] Contouring is performed using an adaptation of Gueziec and Hummel s tetrahedral decomposition algorithm [12], which we call marching tetragons . Compared to the marching cubes algorithm [15] tetrahedral contouring has the advantages that there are significantly fewer ways for a surface to cut a tetrahedron than a cube, and the resulting surface triangles are implicitly oriented in a consistent ....
[Article contains additional citation context not shown here]
A. Gueziec and R. Hummel. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Trans. Vis. Comp. Graph., 1(4):328--342, 1995.
Morse-Smale Complexes for Piecewise Linear 3-Manifolds - Edelsbrunner, Harer.. (2003) (1 citation) (Correct)
....crossing the boundary everywhere at a right angle. The most popular method for computing an iso surface is the marching cube algorithm, which assumes the density is given by its values at the vertices of a regular cubic grid [11] Extensions and improvements of this algorithm can be found in [9, 23]. The marching cube algorithm visits the entire grid, which implies a running time proportional to the number of grid cells. A significant improvement in performance can be achieved by limiting the traversal to those cells that have a non empty intersection with the constructed iso surface. ....
A. GU EZIEC AND R. HUMMEL. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Trans. Visualization Comput. Graphics 1 (1995), 328--342.
Constructing Anatomically Accurate Face Models using Computed.. - Qureshi (2000) (Correct)
....Review 14 and Gelder1990) Triangulation scheme which biases the topology towards one side of the surface resolves this problem (Montani, Scateni and Scopigno1994) Tessellating the space with tetrahedra rather than cubes also resolves the topological ambiguity. The marching tetrahedra (MT) (Gu eziec and Hummel1995) algorithm constructs a tetrahedral tessellation by decomposing each cube into five tetrahedra. The symmetry of subdivision of the cube has to alternate between cubes to align the faces of the tetrahedra, and this introduces additional ambiguity. Chan and Purisma (1998) have suggested a ....
Gu'eziec, A. and Hummel, R. (1995). Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition. IEEE Transactions on Visualization and Computer Graphics, 1:328--342.
Finite Element Decomposition Of The Human Neocortex - Chow (1998) (1 citation) (Correct)
....to the differential geometry of parametric surfaces [14] 22] consequently, the estimation of principal curvatures for triangulated surfaces rests on these definitions. The estimating schemes rely on local approximations, employing constructs such as the angle deficit [1] the Hessian matrix [28], and the osculating paraboloid [31] We discuss Hamann s technique, which locally fits a group of points to an osculating paraboloid and computes the principal curvatures by solving a bivariate polynomial. For a point p 0 on a regular parametric two dimensional surface S in real ....
A. Gueziec and R. Hummel, "Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition," IEEE Transactions on Visualization and Computer Graphics, Vol. 1, No. 4, pp. 328-342, 1995. 107
Regularised Marching Tetrahedra: Improved Iso-Surface.. - Treece, Prager, Gee (1998) (7 citations) (Correct)
....with tetrahedra rather than cubes. Tetrahedra only have 16 possible triangulations, which reduce to 3 by symmetry. These are shown (save for the case where no triangulation is required) in Figure 2. A tetrahedral tessellation was originally constructed by dividing each cube into five tetrahedra [7, 20]. Unfortunately, this introduces an additional ambiguity since the symmetry of the subdivision of the cube has to alternate between cubes, in order to align the faces of the tetrahedra. There are, therefore, two possible tessellations for a given cubic lattice, which can generate opposed ....
....iso surface construction. Both of these employ tetrahedral lattices. In [8] vertices which are near to the corners of the tetrahedra (within 5 of the tetrahedra edge length) are snapped to the tetrahedra corner locations, thus eliminating any triangles with edges shorter than this distance. In [6, 7], surface perturbation is optionally allowed, whereby positive values sampled at the tetrahedral vertices are set to zero, thus ensuring all new vertices are positioned at the tetrahedral vertices, and the triangulation consists entirely of tetrahedral faces. 2.3 Surface from cross sections ....
[Article contains additional citation context not shown here]
A. Gu'eziec and R. Hummel. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Transactions on Visualization and Computer Graphics, 1(4):328-- 342, December 1995.
An Efficient Algorithm for Terrain Simplification - Agarwal, Desikan (1997) (10 citations) (Correct)
....that the simplified polygonal models that fit the given surface well and that they are composed of a small number of polygons. Although there has been a lot of work on surface simplification in computer graphics, GIS, and scientific computing, most of the work is based on heuristic approaches [4, 11, 18, 19, 21, 25, 28, 29, 35, 39]. It is therefore not surprising that these algorithms do not guarantee any bounds on the quality of the simplification. In this paper, we study the surface approximation problem for xy monotone surfaces (i.e. for terrains) The surfaces represent graphs of bivariate functions f(x; y) and arise ....
A. Gueziec and R. Hummel, Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Trans. on Visualization and Computer Graphics 1 (1995), 328--342.
Morse-Smale Complexes for Piecewise Linear 3-Manifolds - Herbert Edelsbrunner John (2003) (1 citation) (Correct)
No context found.
A. GU EZIEC AND R. HUMMEL. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Trans. Visualization Comput. Graphics 1 (1995), 328--342.
Surface Simplification and Edgebreaker Compression for 2D.. - Kwatra, Rossignac (Correct)
No context found.
A. Gueziec and R. Hummel, Exploiting triangulated surface extraction using tetrahedral decomposition, IEE Transactions on Visualization and Computer Graphics, 1:328-342, 1995.
Space-Time Surface Simplification And Edgebreaker.. - Kwatra, Rossignac (Correct)
No context found.
A. Gueziec and R. Hummel, "Exploiting triangulated surface extraction using tetrahedral decomposition", IEEE Transactions on Visualization and Computer Graphics, 1:328-342, 1995.
Metasurfaces: Contouring with Changing Isovalue - Matyas, Linsen, Hamann (2005) (Correct)
No context found.
Andre Gueziec and Robert Hummel. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Transaction on Visualization and Computer Graphics, 1(4):328--342, 1995.
Morse-Smale Complexes for Piecewise Linear 3-Manifolds - Edelsbrunner, Harer.. (2003) (1 citation) (Correct)
No context found.
A. GU EZIEC AND R. HUMMEL. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Trans. Visualization Comput. Graphics 1 (1995), 328--342.
Multiple Transparent Material-enriched Isosurfaces - Ravindra Kanodia Lars (2005) (Correct)
No context found.
Andre Gueziec and Robert Hummel. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Transaction on Visualization and Computer Graphics, 1(4):328--342, 1995.
Morse-Smale Complexes for Piecewise Linear 3-Manifolds - John (2003) (1 citation) (Correct)
No context found.
A. GU EZIEC AND R. HUMMEL. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Trans. Visualization Comput. Graphics 1 (1995), 328--342.
3D Tomograph Reconstruction Using Geometrical Models - Battle, Cunningham, Hanson (1997) (Correct)
No context found.
A. Gueziec and R. Hummel, "Exploiting triangulated surface extraction using tetrahedral decomposition," IEEE Trans. Vis. Comp. Graph. 1, pp. 328--342, 1995.
Accuracy in Scientific Visualization - Lopes (1999) (Correct)
No context found.
A Gu eziec and R Hummel. Exploiting triangulated surface extraction using tetrahedral decomposition. IEEE Transactions on Visualization and Computer Graphics, 1:328--342, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC