3D mesh geometry filtering algorithms for progressive transmission schemes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

3D mesh geometry filtering algorithms for progressive transmission schemes

A number of static and multi-resolution methods have been introduced in recent years to compress 3D meshes. In most of these methods, the connectivity information is encoded without loss of information, but user-controllable loss of information is tolerated while compressing the geometry and property data. All these methods are very efficient at compressing the connectivity information, in some...

متن کامل

3D Geometry Compression and Progressive Transmission

Polygonal meshes remain the primary representation for visualization of 3D data in a wide range of industries, including manufacturing, architecture, geographic information systems, medical imaging, robotics, entertainment, and military applications. Because of its widespread use, it is desirable to compress polygonal meshes stored in file servers and exchanged over computer networks to reduce ...

متن کامل

Static/Dynamic Filtering for Mesh Geometry

The joint bilateral filter, which enables feature-preserving signal smoothing according to the structural information from a guidance, has been applied for various tasks in geometry processing. Existing methods either rely on a static guidance that may be inconsistent with the input and lead to unsatisfactory results, or a dynamic guidance that is automatically updated but sensitive to noises a...

متن کامل

Fast Median Filtering Algorithms for Mesh Computers Fast Median Filtering Algorithms for Mesh Computers

Two fast algorithms for median ltering of images using parallel computers having 2-D mesh interconnections are given. Both algorithms assume that an n n image is loaded onto the mesh with one processing element per pixel. One algorithm performs median l-tering over d d neighborhoods in O(d 2) time and works with pixel values in an arbitrarily large range. This algorithm, while theoretically sub...

متن کامل

Fast Mesh Simplification for Progressive Transmission

A very fast mesh simplification algorithm based on halfedge collapse is proposed in this work with a focus on progressive graphic transmission applications. We generalize the Quadric Error Metric (QEM) method to accommodate new topological operations. A flatness criterion is combined with the defined metric to preserve the visual quality of simplified meshes. We further adopt the vertex-based p...

متن کامل

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


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

ژورنال

عنوان ژورنال: Computer-Aided Design

سال: 2000

ISSN: 0010-4485

DOI: 10.1016/s0010-4485(00)00069-5