By Topic

3D mesh compression using an efficient neighborhood-based segmentation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lijun Chen ; Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont., Canada ; Georganas, Nicolas D.

3D mesh compression and segmentation are two active areas of 3D object modeling. Most existing 3D compression algorithms compress the whole object to reduce the local storage requirement and the delays in transmitting objects over the Internet. However, in some interactive applications, the client may be interested in particular section(s) of the object. The server needs to segment the object into pans and send them individually or sequentially. This paper presents a segmentation based 3D mesh compression scheme that can meet this requirement. We propose an efficient eXtend Multi-Ring neighborhood (XMR) based 3D mesh segmentation algorithm that decomposes the object into meaningful regions. Then we compress them separately and put them into one stream. The common boundary triangles that are used for adhering the regions together are processed and appended to the end of the stream. We call this a region-conquer-and-stitch scheme.

Published in:

Distributed Simulation and Real-Time Applications, 2005. DS-RT 2005 Proceedings. Ninth IEEE International Symposium on

Date of Conference:

10-12 Oct. 2005