Discretization of parametric surfaces not only expedites their rendering, but also facilitates other applications such as motion planning, collision detection, and engineering analysis. Currently, discretization methods such as Delaunay Triangulation and Advancing Front techniques, which sample and mesh simultaneously and can guarantee well shaped triangles, are popular despite their high compu...

This paper presents a novel procedure for the representation and coding of three-dimensional (3-D) surfaces using hierarchical adaptive triangulation. The proposed procedure is based on pyramidal analysis using the quincunx sampling minimum variance interpolation (QMVINT) filters. These are reduced pyramids with quincunx sampling applied to the parametric representation of the surface, chosen s...

Abstract An adaptive mesh refinement (AMR) technique based on nodal linked-list data structure for lattice Boltzmann method (LBM) is proposed in this paper. It makes connections between which hierarchical and LBM calculation to retain the simplicity of LBM. Based uniform meshes, algorithm refines meshes by constructing nodes levels refined. In structure, relationships neighbors upper lower leve...

Parameterizing meshes is a basic requirement for many applications, including, e.g., reverse engineering , texture mapping, and re-meshing. We present a new fast algorithm that uses the hierarchical representation of a polygonal mesh with arbitrary topology for generating a geometry-driven parameterization.

We develop a new hierarchical reconstruction (HR) method [17, 28] for limiting solutions of the discontinuous Galerkin and finite volume methods up to fourth order of accuracy without local characteristic decomposition for solving hyperbolic nonlinear conservation laws on triangular meshes. The new HR utilizes a set of point values when evaluating polynomials and remainders on neighboring cells...

The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle meshes are preferred due to their algorithmic simplicity, numerical robustness, and efficient display. The possibility to decompose a given triangle mesh into a hierarchy of differently detailed approximations enables...

This paper describes an approach for 3D triangular meshes segmentation. The method that we adopt for the 3D mesh segmentation is based on the unbiased hierarchical queue which has been used for 2D images. Our method uses the hierarchical transformation on a connected faces structure. The approach that we propose is based on the principal curvature to calculate the faces curvature. The results s...

This paper describes a hierarchical registration process using the iterative closest point algorithm combined with a Progressive Mesh. To find the exact pose of objects in a robotic bin picking process we simulate the appearance of object poses and compare them with the real range data provided by laser range sensors. The coarse pose is estimated in a first step and then refined with the well k...

In this paper, we propose a new multiresolution-based shape representation for 3D mesh morphing. Our approach does not use combination operations that caused some serious problems in the previous approaches for mesh morphing. Therefore, we can calculate a hierarchical interpolation mesh robustly using two types of subdivision fitting schemes. Our new representation has a hierarchical semiregula...