Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Ivrissimtzis, Ioannis
Rössl, Christian
Seidel, Hans-Peter

dblp
dblp
dblp



Editor(s):

Coquillart, Sabine
Shum, Heung-Yeung
Hu, Shi-Min

dblp
dblp
dblp

Not MPII Editor(s):

Coquillart, Sabine
Shum, Heung-Yeung
Hu, Shi-Min

BibTeX cite key*:

irs02a

Title, Booktitle

Title*:

A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding


pg2002.pdf (2551.72 KB)

Booktitle*:

Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2002)

Event, URLs

URL of the conference:

http://ncc.cs.tsinghua.edu.cn/pg2002/home.htm

URL for downloading the paper:


Event Address*:

Beijing, China

Language:

English

Event Date*
(no longer used):

-- 9-11, October, 2002

Organization:


Event Start Date:

9 October 2002

Event End Date:

11 October 2002

Publisher

Name*:

IEEE

URL:

http://www.computer.org/

Address*:

Los Alamitos, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

294-303

Year*:

2002

VG Wort Pages:


ISBN/ISSN:

0-7695-1784-6

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the mesh into two submeshes which are encoded separately in a recursive process. We introduce a novel data structure for triangle mesh encoding, a binary tree with positive integer weights assigned to its nodes. The length of the initial strip is stored in the root of the binary tree, while the encoding of the left and right submesh are stored in the left and right subtree, respectively. We find a simple criterion determining which objects of this data
structure correspond to triangle meshes. As the algorithm implicitly traverses the triangles of the mesh, it can be classified into the family of Edgebreaker like encoding schemes. Hence, the compression ratios, both in the form of theoretical upper bounds and practical results are similar to the Edgebreaker's, while the simplicity and flexibility of the algorithm makes it particularly suitable for applications where the connectivity encoding is only a small part of the problem at hand.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Computer Graphics Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{irs02a,
AUTHOR = {Ivrissimtzis, Ioannis and R{\"o}ssl, Christian and Seidel, Hans-Peter},
EDITOR = {Coquillart, Sabine and Shum, Heung-Yeung and Hu, Shi-Min},
TITLE = {A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding},
BOOKTITLE = {Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2002)},
PUBLISHER = {IEEE},
YEAR = {2002},
PAGES = {294--303},
ADDRESS = {Beijing, China},
ISBN = {0-7695-1784-6},
}


Entry last modified by Christine Kiesel, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Ioannis Ivrissimtzis
Created
10/17/2002 04:35:34 PM
Revisions
12.
11.
10.
9.
8.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Thomas Annen
Thomas Annen
Edit Dates
13.08.2003 11:17:04
12.08.2003 16:35:33
12.08.2003 13:53:30
11.08.2003 14:39:58
11.08.2003 14:39:56
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
pg2002.pdf