Results 1  10
of
861
Quadrilateral and tetrahedral mesh stripification using 2factor partitioning of the dual graph
 VISUAL COMPUT
, 2005
"... In order to find a 2factor of a graph, there exist O(n 1.5) deterministic algorithm [7] and O(n³) randomized algorithm [14]. In this paper, we propose novel O(n log³ n log log n) algorithms to find a 2factor, if one exists, of a graph in which all n vertices have degree four or less. Such graphs ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. Such graphs are actually dual graphs of quadrilateral and tetrahedral meshes. A 2factor of such graphs implicitly defines a linear ordering of the mesh primitives in the form of strips. Further, by introducing a few additional primitives, we reduce the number of tetrahedral strips to represent the entire
ABSTRACT Quadrilateral and Tetrahedral Mesh Stripification Using 2Factor Partitioning of the Dual Graph
"... Finding a 2factor of a generic graph is a difficult problem and there are randomized algorithms proposed to solve this problem in O(n 3) complexity [12]. In this paper, we propose algorithms that find a 2factor of a graph, if one exists, for a restricted class of graphs in which all vertices have ..."
Abstract
 Add to MetaCart
degree four or less, in O(n 2) complexity where n is the number of vertices of the graph. Such graphs are actually dual graphs of quadrilateral and tetrahedral meshes that are widely used in graphics and visualization applications. We use the 2factor of these graphs to find linear ordering
Tetrahedral Mesh Generation by Delaunay Refinement
 Proc. 14th Annu. ACM Sympos. Comput. Geom
, 1998
"... Given a complex of vertices, constraining segments, and planar straightline constraining facets in E 3 , with no input angle less than 90 ffi , an algorithm presented herein can generate a conforming mesh of Delaunay tetrahedra whose circumradiustoshortest edge ratios are no greater than two ..."
Abstract

Cited by 133 (6 self)
 Add to MetaCart
Given a complex of vertices, constraining segments, and planar straightline constraining facets in E 3 , with no input angle less than 90 ffi , an algorithm presented herein can generate a conforming mesh of Delaunay tetrahedra whose circumradiustoshortest edge ratios are no greater than
TextureEncoded Tetrahedral Strips
 In Proceedings of Symposium on Volume Visualization 2004
, 2004
"... Figure 1: Volume visualizations of tetrahedral meshes which have been encoded in a compact texture representation based on tetrahedral strips and are stored in the texture memory of the graphics adapter. The renderings have been computed with a ray casting algorithm for programmable graphics hardwar ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
hardware adapted for this mesh representation. The use of triangle strips is a common method to compactly store and efficiently render large polygonal meshes. The advantages of triangle stripification also apply to tetrahedral meshes; therefore, tetrahedral strips are an attractive data structure
Tetrahedral Mesh Improvement Using Swapping and Smoothing
 INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING
, 1997
"... Automatic mesh generation and adaptive refinement methods for complex threedimensional domains have proven to be very successful tools for the efficient solution of complex applications problems. These methods can, however, produce poorly shaped elements that cause the numerical solution to be less ..."
Abstract

Cited by 110 (12 self)
 Add to MetaCart
several recommendations for the improvement of tetrahedral meshes.
Aggressive Tetrahedral Mesh Improvement
 In Proc. of the 16th Int. Meshing Roundtable
, 2007
"... Summary. We present a tetrahedral mesh improvement schedule that usually creates meshes whose worst tetrahedra have a level of quality substantially better than those produced by any previous method for tetrahedral mesh generation or “mesh cleanup. ” Our goal is to aggressively optimize the worst t ..."
Abstract

Cited by 39 (4 self)
 Add to MetaCart
Summary. We present a tetrahedral mesh improvement schedule that usually creates meshes whose worst tetrahedra have a level of quality substantially better than those produced by any previous method for tetrahedral mesh generation or “mesh cleanup. ” Our goal is to aggressively optimize the worst
Progressive Tetrahedralizations
, 1998
"... This paper describes some fundamental issues for robust implementations of progressively refined tetrahedralizations generated through sequences of edge collapses. We address the definition of appropriate cost functions and explain on various tests which are necessary to preserve the consistency of ..."
Abstract

Cited by 64 (3 self)
 Add to MetaCart
This paper describes some fundamental issues for robust implementations of progressively refined tetrahedralizations generated through sequences of edge collapses. We address the definition of appropriate cost functions and explain on various tests which are necessary to preserve the consistency
An Iterative Stripification Algorithm Based on Dual Graph Operations
 IN PROCEEDINGS OF EUROGRAPHICS 2003 (SHORT PRESENTATIONS
, 2003
"... This paper describes the preliminary results obtained using an iterative method for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iteratively rearrange and decre ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
This paper describes the preliminary results obtained using an iterative method for generating a set of triangle strips from a mesh of triangles. The algorithm uses a simple topological operation on the dual graph of the mesh, to generate an initial stripification and iteratively rearrange
Streaming simplification of tetrahedral meshes
 IEEE Transactions on Visualization and Computer Graphics
, 2005
"... Abstract—Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By reducing the size of the data, we can ac ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
Abstract—Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By reducing the size of the data, we can
Results 1  10
of
861