Prof. Aihong Qin Profile

Prof. Aihong Qin

at Zhejiang Univ

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 18 January 2006 Paper

Piecewise compression of large mesh

Aihong Qin, Hua Xiong, Jiaoying Shi, Zhen Liu

Proceedings Volume 6066, 60660P (2006) https://doi.org/10.1117/12.642727

KEYWORDS: Data modeling, Image processing, Visualization, Computer programming, Standards development, 3D acquisition, Surgery, Image segmentation, Computing systems, 3D imaging standards

Read Abstract +

Large and detailed 3D polygon mesh with standard representation results in files of gigantic size. The need for more compact representations and a parallel implementation is clear. But the compressed gigantic mesh applied in parallel rendering to achieve high performance is still an unexplored area. In this work, we present a mesh compression scheme employed in parallel rendering system. It includes two parts: Mesh segmentation and segments compression. Firstly, the multilevel graph partitioning idea is adopted to separate the mesh into large patches with less curvature. Then the large patches are farther partitioned with MeTiS[1] to get small patches with a balanced vertex counts. As the multi-level mesh produced by the feature preserved mesh simplification procedure, our segmentation algorithm takes both the segment's flatness and balanced vertex counts into account. Secondly, each patch is compressed separately. The vertices in the patch are classified into two distinguish types, namely boundary vertex and inner vertex, different compression algorithm are applied to them. The boundary vertexes are compressed with a novel compression algorithm PMC proposed in this work. To avoid decoding the whole boundary during every frame rendering, the boundary vertexes are compressed piecewise. The successive boundary edges shared by the same patches can act as a piece element when it is compressed. During sorting only the encoded boundary in the view-frustum needs to be loaded and decompressed. Experiments show that the encoded mesh can be partitioned in compression-domain in parallel rendering system. It reduces the communication bandwidth requirement significantly.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

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

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years