Optimizing triangular mesh generation from range images

Tianyu Lu; David Y. Yun

doi:10.1117/12.380036

16 March 2000 Optimizing triangular mesh generation from range images

Tianyu Lu, David Y. Yun

Proceedings Volume 3958, Three-Dimensional Image Capture and Applications III; (2000) https://doi.org/10.1117/12.380036
Event: Electronic Imaging, 2000, San Jose, CA, United States

Abstract

An algorithm for the automatic reconstruction of triangular mesh surface model form range images is presented. The optimal piecewise linear surface approximation problem is defined as: given a set S of points uniformly sampled from a vibrate function f(x,y) on a rectangular grid of dimension W X H, find a minimum triangular mesh approximating the surface with vertices anchored at a subset S' of S, such that the deviation at any sample point is within a given bound of (epsilon) > 0. The algorithm deploys a multi- agent resource planning approach to achieve adaptive, accurate and concise piecewise linear approximation using the L-(infinity) norm. The resulting manifold triangular mesh can be directly used as 3D rendering model for visualization with controllable and guaranteed quality. Due to this dual optimality, the algorithm achieves both storage efficiency and visual quality. The error control scheme further facilitates the construction of models in multiple levels of details, which is desirable in animation and virtual reality moving scenes. Experiments with various benchmark range images form smooth functional surfaces to satellite terrain images yield succinct, accurate and visually pleasant triangular meshes. Furthermore, the independence and multiplicity of agents suggest a natural parallelism for triangulation computation, which provides a promising solution for the real-time exploration of large data sets.

Citation Download Citation

Tianyu Lu and David Y. Yun "Optimizing triangular mesh generation from range images", Proc. SPIE 3958, Three-Dimensional Image Capture and Applications III, (16 March 2000); https://doi.org/10.1117/12.380036

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available