Alireza Rezaei Mahdiraji
Abstract
Despite ubiquitous usage of unstructured mesh in many application domains (e.g., computer aided design, scientific simulation, climate modeling, etc.), there is no specialized mesh database which supports storing and querying such data structures. Existing mesh libraries use file-based APIs which do not support declarative querying and are difficult to maintain. A mesh database can benefit these domains in several ways such as: declarative query language, ease of maintenance, query optimization, etc. In this thesis work, the core idea is to have a very general model which can represent objects from different domains and specialize it to smaller object classes using combinatorial constraints. We propose the Incidence multi-Graph Complex (ImG-Complex) data model for storing combinatorial aspect of meshes in a database. We extend incidence graph (IG) representation with multi-incidence information (ImG) to represent a class of objects which we call ImG-Complexes. ImG-Complex can support a wide range of application domains. We introduce optional and application-specific constraints to restrain the general ImG model to specific object classes or specific geometric representations. The constraints check validity of meshes based on the properties of the modeled object class. Finally, we show how graph databases can be utilized and reused to query some combinatorial mesh queries based on the (possibly constrained) ImG model. In particular, we show the strengths and limitations of a graph-only query language in expressing combinatorial mesh queries.
- http://neo4j.org.Google Scholar
- R. Angles and C. Gutierrez. Survey of graph database models. ACM Comput. Surv., 40(1):1:1-1:39, Feb. 2008. Google Scholar
- P. Baumann. A formal specification of a boundary representation. In Eurographics, volume 88, pages 141-154, 1988.Google Scholar
- B. G. Baumgart. A polyhedron representation for computer vision. In Proc. National computer conference and exposition, AFIPS'75, pages 589-596, New York, NY, USA, 1975. ACM. Google Scholar
- G. Berti. Generic software components for Scientific Computing. PhD thesis, BTU Cottbus, 2000.Google Scholar
- G. Berti. Gral - the grid algorithms library. Future Generation Computer Systems, 22, 2006. Google Scholar
- E. Brisson. Representing geometric structures in d dimensions: topology and order. In Proc. 5th ann. symp. on Computational geometry, SCG'89, pages 218-227, New York, NY, USA, 1989. ACM. Google Scholar
- V. A. et al. High resolution forward and inverse earthquake modeling on terascale computers. In SC, page 52, 2003. Google Scholar
- B. Howe. Gridfields: model-driven data transformation in the physical sciences. PhD thesis, Portland, OR, USA, 2007. AAI3255425. Google Scholar
- B. Howe and D. Maier. Algebraic manipulation of scientific datasets. In Proc. 30th Int'l Conf. on Very large data bases, VLDB'04, pages 924-935, 2004. Google Scholar
- B. Levy and J.-L. Mallet. Cellular modelling in arbitrary dimension using generalized maps. Technical report, ISA-GOCAD (Inria-Lorraine/CNRS), 1999.Google Scholar
- P. Lienhardt. Topological models for boundary representation: a comparison with n-dimensional generalized maps. Comput. Aided Des., 23(1):59-82, Feb. 1991. Google Scholar
- P. Lienhardt, L. Fuchs, Y. Bertrand, et al. Combinatorial models for topology-based geometric modeling. Theory and applications of proximity, nearness and uniformity, pages 151-198, 2009.Google Scholar
- D. W. Moore. Simplicial mesh generation with applications. PhD thesis, Ithaca, NY, USA, 1992. UMI Order No. GAX93-00795. Google Scholar
- OGC. Opengis simple features specification for sql. Technical report, Revision 1.0, 1998.Google Scholar
- C. Pain, M. Piggott, A. Goddard, F. Fang, G. Gorman, D. Marshall, M. Eaton, P. Power, and C. De Oliveira. Three-dimensional unstructured mesh ocean modelling. Ocean Modelling, 10(1):5-33, 2005.Google Scholar
- C. Silva, Y. jen Chiang, W. Corrêa, J. El-sana, and P. Lindstrom. Out-of-core algorithms for scientific visualization and computer graphics. In Visualization 2002 Course Notes, 2002.Google Scholar
- G. M. Ziegler. Lectures on polytopes. Springer-Verlag, New York, 1995.Google Scholar
Index Terms
- Database support for unstructured meshes
Recommendations
Interpolatory, solid subdivision of unstructured hexahedral meshes
This paper presents a new, volumetric subdivision scheme for interpolation of arbitrary hexahedral meshes. To date, nearly every existing volumetric subdivision scheme is approximating, i.e., with each application of the subdivision algorithm, the ...
Simplification of unstructured tetrahedral meshes by point sampling
VG'05: Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume GraphicsTetrahedral meshes are widely used in scientific computing for representing three-dimensional scalar, vector, and tensor fields. The size and complexity of some of these meshes can limit the performance of many visualization algorithms, making it hard ...
Accurate Volume Rendering of Unstructured Hexahedral Meshes
SIBGRAPI '11: Proceedings of the 2011 24th SIBGRAPI Conference on Graphics, Patterns and ImagesImportant engineering applications use unstructured hexahedral meshes for numerical simulations. Hexahedral cells, when compared to tetrahedral ones, tend to be more numerically stable and to require less mesh refinement. However, volume visualization ...
Comments