Considerations toward a Dynamic Mesh Data Structure

Generating subdivision surfaces from polygonal meshes requires the complete topological information of the original mesh, in order to find the neighbouring faces, and vertices used in the subdivision computations. Normally, winged-edge type data-structures are used to maintain such information about a mesh. For rendering meshes, most of the topological information is irrelevant, and winged-edge type data-structures are inefficient due to their extensive use of dynamical data structures. A standard approach is the extraction of a rendering mesh from the winged-edge type data structure, thereby increasing the memory footprint significantly. We introduce a mesh data-structure that is efficient for both tasks: creating subdivision surfaces as well as fast rendering. The new data structure maintains full topological information in an efficient and easily accessible manner, with all information necessary for rendering optimally suited for current graphics hardware. This is possible by dis...

Computers & Structures, 1988

Some recent efforts on the development of methods to ensun the robustness of automatic thracdimensional mesh generation techniques arc discuss& The topic arcas considered arc mesh entity classification, finite octrcc cell triangulation, and coarse mesh generation by element removal.

Computer Graphics and …

2000

This work introduces a scalable topological data structure for manifold triangular meshes called Compact Half-Edge (CHE). It provides a high degree of scalability, since it is able to optimize the memory consumption / execution time ratio for different applications and data by using features of its different levels. An object-oriented API using class inheritance and virtual instantiation enables a unique

This paper introduces a new b-rep (boundary representation) data structure, called AIF (Adjacency and Incidence Framework). It is concise and enables fast access to topological information. Its conciseness results from the fact that it is an orientable, but not an oriented, data structure, i.e. an orientation can be topologically induced as necessary in many applications. It is an optimal 9 4 C data structure for polygonal meshes, which means that a minimal number of direct and indirect accesses are required to retrieve adjacency and incidence information from it. Besides, the AIF data structure may accommodate general polygonal meshes, regardless of whether or not they are triangular and manifold.

Proceedings of the 1st International Conference on Computer Graphics and Interactive Techniques in Australasia and South East Asia, GRAPHITE '03, 2003

This paper introduces a concise and responsiveness data structure, called AIF (Adjacency and Incidence Framework), for multiresolution meshes, as well as a new simplification algorithm based on the planarity of neighboring faces. It is an optimal data structure for polygonal meshes, manifold and non-manifold, which means that a minimal number of direct and indirect accesses are required to retrieve adjacency and incidence information from it. These querying tools are necessary for dynamic multiresolution meshing algorithms (e.g. refinement and simplification operations). AIF is an orientable, but not oriented, data structure, i.e. an orientation can be topologically induced as needed in many computer graphics and geometric modelling applications. On the other hand, the simplification algorithm proposed in this paper is "memoryless" in the sense that only the current approximation counts to compute the next one; no information about the original shape or previous approximations is considered.

Computer Graphics Forum, 2013

Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of data structures and geometry processing algorithms based on them has been developed in the literature. At the same time, quadrilateral meshes, especially semiregular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the last several years. In this survey we discuss the advantages and problems of techniques operating on quadrilateral meshes, including surface analysis and mesh quality, simplification, adaptive refinement, alignment with features, parametrisation and remeshing.

ACM Transactions on Mathematical Software, 2010

Much of the effort required to create a new simulation code goes into developing infrastructure for mesh data manipulation, adaptive refinement, design optimization, and so forth. This infrastructure is an obvious target for code reuse, except that implementations of these functionalities are typically tied to specific data structures. In this article, we describe a software component---an abstract data model and programming interface---designed to provide low-level mesh query and manipulation support for meshing and solution algorithms. The component’s data model provides a data abstraction, completely hiding all details of how mesh data is stored, while its interface defines how applications can interact with that data. Because the component has been carefully designed to be general purpose and efficient, it provides a practical platform for implementing high-level mesh operations independently of the underlying mesh data structures. After describing the data model and interface, ...

We present an Array-based Half-Facet mesh data structure, or AHF, for efficient mesh query and modification operations. The AHF extends the compact array-based half-edge and half-face data structures (T.J. Alumbaugh and X. Jiao, Compact array-based mesh data structures, IMR, 2005) to support mixed-dimensional and non-manifold meshes. The design goals of our data structure include generality to support such meshes, efficiency of neighborhood queries and mesh modification, compactness of memory footprint, and facilitation of interoperability of mesh-based application codes. To accomplish these goals, our data structure uses sibling half-facets as a core abstraction, coupled with other explicit and implicit representations of entities. A unique feature of our data structure is a comprehensive implementation in MATLAB, which allows rapid prototyping, debugging, testing, and deployment of meshing algorithms and other mesh-based numerical methods. We have also developed C++ implementation built on top of MOAB (T.J. Tautges, R. Meyers, and K. Merkley, MOAB: A Mesh-Oriented Database, Sandia National Laboratories, 2004). We present some comparisons of the memory requirements and computational costs, and also demonstrate its effectiveness with a few sample applications.

2007

Abstract: This paper describes an approach to construct unstructured tetrahedral and hexa-hedral meshes for a domain with multiple materials. We have developed an octree-based iso-contouring method to construct unstructured 3D meshes for a single material domain. Based on it, we analyze each material change edge instead of sign change edge to figure out in-terfaces between two materials, and mesh each material region with conforming boundaries. Two kinds of surfaces, the boundary surface and the interface between two different material regions, are meshed and distinguished. Both material change edges and interior edges are an-alyzed to construct tetrahedral meshes, and interior grid points are analyzed for hexahedral mesh construction. Finally the edge-contraction and smoothing method is used to improve the quality of tetrahedral meshes, and a combination of pillowing, geometric flow and optimiza-tion techniques are used for hexahedral mesh quality improvement. The shrink set is def...