.png){kind=icon}
.png){kind=icon}
Return
Hierarchical grid conversion
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cad.2016.04.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Hierarchical grids appear in various applications in computer graphics such as subdivision and multiresolution surfaces, and terrain models. Since the different grid types perform better at different tasks, it is desired to switch between regular grids to take advantages of these grids. Based on a 2D domain obtained from the connectivity information of a mesh, we can define simple conversions to switch between regular grids. In this paper, we introduce a general framework that can be used to convert a given grid to another and we discuss the properties of these refinements such as their transformations. This framework is hierarchical meaning that it provides conversions between meshes at different level of refinement. To describe the use of this framework, we define new regular and near-regular refinements with good properties such as small factors. We also describe how grid conversion enables us to use patch based data structures for hexagonal cells and near-regular refinements. To do so, meshes are converted to a set of quadrilateral patches that can be stored in simple structures. Near-regular refinements are also supported by defining two sets of neighborhood vectors that connect a vertex to its neighbors and are useful to address connectivity queries. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Refinements
Grid conversion
Patch-based data structures
Transformations
Semiregular
Subdivision
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.