Modeling Range Images with Bounded Error Triangular Meshes without Optimization

نویسندگان

  • Angel Domingo Sappa
  • Miguel Angel García
چکیده

This paper presents a new technique for approximating range images by means of adaptive triangular meshes with a bounded approximation error and without applying optimization. This new approach consists of three stages. In the first stage, every pixel of the given range image is mapped to a 3D point defined in a reference frame associated with the range sensor. Then, those 3D points are mapped to a 3D curvature space. In the second stage, the points contained in this curvature space are triangulated through a 3D Delaunay algorithm, giving rise to a tetrahedronization of them. In the last stage, an iterative process starts digging the external surface of the previous tetrahedronization, removing those triangles that do not fulfill the given approximation error. In this way, successive fronts of triangular meshes are obtained in both range image space and curvature space. This iterative process is applied until a triangular mesh in the range image space fulfilling the given approximation error is obtained. Experimental results are presented.

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

ثبت نام

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

منابع مشابه

Coarse-to-fine approximation of range images with bounded error adaptive triangular meshes

bstract. A new technique for approximating range images with daptive triangular meshes ensuring a user-defined approximation rror is presented. This technique is based on an efficient coarseo-fine refinement algorithm that avoids iterative optimization stages. he algorithm first maps the pixels of the given range image to 3D oints defined in a curvature space. Those points are then tetraheraliz...

متن کامل

Pressure-Velocity Coupled Finite Volume Solution of Steady Incompressible Invscid Flow Using Artificial Compressibility Technique

Application of the computer simulation for solving the incompressible flow problems motivates developing efficient and accurate numerical models. The set of Inviscid Incompressible Euler equations can be applied for wide range of engineering applications. For the steady state problems, the equation of continuity can be simultaneously solved with the equations of motion in a coupled manner using...

متن کامل

Efficient Approximation of Gray-Scale Images Through Bounded Error Triangular Meshes

This paper presents an iterative algorithm for approximating gray-scale images with adaptive triangular meshes ensuring a given tolerance. At each iteration, the algorithm applies a non-iterative adaptive meshing technique. In this way, this technique converges faster than traditional mesh refinement algorithms. The performance of the proposed technique is studied in terms of compression ratio ...

متن کامل

Minimizing the Multi-view Stereo Reprojection Error for Triangular Surface Meshes

This article proposes a variational multi-view stereo vision method based on meshes for recovering 3D scenes (shape and radiance) from images. Our method is based on generative models and minimizes the reprojection error (difference between the observed images and the images synthesized from the reconstruction). Our contributions are twofold. 1) For the first time, we rigorously compute the gra...

متن کامل

Discontinuous Galerkin methods for Maxwell’s equations in Drude metamaterials on unstructured meshes

In this follow-up work, we extend the discontinuous Galerkin (DG) methods previously developed on rectangular meshes [18] to triangular meshes. The DG schemes in [18] are both optimally convergent and energy conserving. However, as we shall see in the numerical results section, the DG schemes on triangular meshes only have suboptimal convergence rate. We prove the energy conservation and an err...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

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