Variable Resolution 4-k Meshes

نویسندگان

  • Luiz Velho
  • Jonas Gomes
چکیده

In this paper we introduce variable resoultion 4–k meshes, a powerful structure for the representation of geometric objects at multiple levels of detail. It combines most properties of other related descriptions with several advantages, such as more flexibility and greater expressive power. The main unique feature of the 4–k mesh structure lies in its variable resolution capability, which is crucial for adaptive computation. We also give an overview of the different methods for constructing the hierarchical 4–k mesh representation, as well as the basic algorithms necessary to incorporate it in modeling and graphics applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable Resolution 4-k Meshes: Concepts and Applications

In this paper we introduce variable resolution 4–k meshes, a powerful structure for the representation of geometric objects at multiple levels of detail. It combines most properties of other related descriptions with several advantages, such as more flexibility and greater expressive power. The main unique feature of the 4–k mesh structure lies in its variable resolution capability, which is cr...

متن کامل

Mesh Simplification Using Four-Face Clusters

In this paper we introduce a new algorithm for simplification of polygonal meshes. It generates a variable resolution structure called hierarchical 4-K mesh. This structure is a powerful representation for non-uniform level of detail that, among other things, allows simple and efficient extraction of conforming meshes.

متن کامل

OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

متن کامل

A Multiscale Nonhydrostatic Atmospheric Model Using Centroidal Voronoi Tesselations and C-Grid Staggering

The formulation of a fully compressible nonhydrostatic atmospheric model called the Model for Prediction Across Scales–Atmosphere (MPAS-A) is described. The solver is discretized using centroidal Voronoi meshes and a C-grid staggering of the prognostic variables, and it incorporates a split-explicit time-integration technique used in many existing nonhydrostatic mesoand cloud-scale models. MPAS...

متن کامل

Semi-Regular 4-8 Refinement and Box Spline Surfaces

In this paper we introduce a new mesh refinement method for subdivision surfaces. It generates a semiregular 4-direction hierarchical structure from control meshes representing 2D manifolds of arbitrary topology. The main advantage of this structure is that it allows the extraction of conforming variable-resolution meshes based on spatially varying adaptation functions. We also present a smooth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000