Streaming Simplification of Tetrahedral Meshes
نویسندگان
چکیده
منابع مشابه
Streaming Simplification of Tetrahedral Meshes
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 accomplish real-time visualization necessary for scientific analysis. We propose a two-step approach for str...
متن کاملSimplification of Nonconvex Tetrahedral Meshes
We present a new solution to the well-known problems of edge collapses in nonconvex tetrahedral meshes. Additionally, our method is able to handle meshes with topologically non-trivial boundaries and to control the modification of the topology of the mesh’s boundary.
متن کاملSubstructure Topology Preserving Simplification of Tetrahedral Meshes
Interdisciplinary efforts in modeling and simulating phenomena have led to complex multi-physics models involving different physical properties and materials in the same system. Within a 3d domain, substructures of lower dimensions appear at the interface between different materials. Correspondingly, an unstructured tetrahedral mesh used for such a simulation includes 2d and 1d substructures em...
متن کاملStreaming compression of tetrahedral volume meshes
Geometry processing algorithms have traditionally assumed that the input data is entirely in main memory and available for random access. This assumption does not scale to large data sets, as exhausting the physical memory typically leads to IO-inefficient thrashing. Recent works advocate processing geometry in a “streaming” manner, where computation and output begin as soon as possible. Stream...
متن کاملImplementing Streaming Simplification for large Labeled Meshes
Data capture technologies like airborne LIDAR produce extremely large models of digital terrain, which must be simplified to be useful. Garland and Heckbert’s quadric error metric in conjunction with edge contraction gives a greedy approach to simplify a mesh that can fit in memory; we adapt it to work with boundaries and labels (e.g., object ID, ground vs. building, or some discrimination betw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2007
ISSN: 1077-2626
DOI: 10.1109/tvcg.2007.21