Andrzej Szymczak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrzej Szymczak has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Alla Safonova
Computer Science Department, Carnegie Mellon University, USA
1 shared publication - Allen Tannenbaum
Schools of Electrical and Computer and Biomedical Engineering, Georgia Institute of Technology, Atlanta, GA, USA
1 shared publication - Arthur Stillman
Cardiothoracic Radiology, Department of Radiology, Emory University School of Medicine, 1364 Clifton Road, NE, Atlanta, GA 30322, USA
1 shared publication - Davis King
Graphics, Visualization, and Usability Center College of Computing Georgia Institute of Technology
1 shared publication - Geovan Tavares
Laboratório Matmídia, PUC-Rio, Rio de Janeiro, Brazil
1 shared publication - Hélio Lopes
Department of Informatics, Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Rio de Janeiro, Brazil
1 shared publication
Latest Publications
- 1 August 2006
- Published by Elsevier in Medical Image Analysis
- Vol. 10 (4) , 548-559
Coronary vessel trees from 3D imagery: A topological approach
- 1 August 2006
- Published by Elsevier in Medical Image Analysis
- Vol. 10 (4) , 548-559
Coronary vessel trees from 3D imagery: A topological approach
- 31 August 2003
- Published by Elsevier in Computers & Graphics
- Vol. 27 (4) , 553-567
Edgebreaker: a simple implementation for surfaces with handles
- 31 August 2003
- Published by Elsevier in Computers & Graphics
- Vol. 27 (4) , 553-567
Edgebreaker: a simple implementation for surfaces with handles
- 1 July 2003
- Published by Springer Nature in The Visual Computer
- Vol. 19 (4) , 271-278
Optimized Edgebreaker encoding for large and regular triangle meshes
- 1 July 2003
- Published by Springer Nature in The Visual Computer
- Vol. 19 (4) , 271-278
Optimized Edgebreaker encoding for large and regular triangle meshes
- Open Access
Connectivity Compression for Irregular Quadrilateral Meshes
Applications that require Internet access to remote 3D datasets are often limited by the storage costs of 3D models. Several compression methods are available to address these limits for objects represented by triangle meshes. Many CAD and VRML models, however, are represented as quadrilateral meshes or mixed triangle/quadrilateral meshes, and these models may also require compression. We present an algorithm for encoding the connectivity of such quadrilateral meshes, and we demonstrate that by preserving and exploiting the original quad structure, our approach achieves encodings 30 - 80% smaller than an approach based on randomly splitting quads into triangles. We present both a code with a proven worst-case cost of 3 bits per vertex (or 2.75 bits per vertex for meshes without valence-two vertices) and entropy-coding results for typical meshes ranging from 0.3 to 0.9 bits per vertex, depending on the regularity of the mesh. Our method may be implemented by a rule for a particular splitting of quads into triangles and by using the compression and decompression algorithms introduced in [Rossignac99] and [Rossignac&Szymczak99]. We also present extensions to the algorithm to compress meshes with holes and handles and meshes containing triangles and other polygons as well as quads.
Open AccessConnectivity Compression for Irregular Quadrilateral Meshes
Applications that require Internet access to remote 3D datasets are often limited by the storage costs of 3D models. Several compression methods are available to address these limits for objects represented by triangle meshes. Many CAD and VRML models, however, are represented as quadrilateral meshes or mixed triangle/quadrilateral meshes, and these models may also require compression. We present an algorithm for encoding the connectivity of such quadrilateral meshes, and we demonstrate that by preserving and exploiting the original quad structure, our approach achieves encodings 30 - 80% smaller than an approach based on randomly splitting quads into triangles. We present both a code with a proven worst-case cost of 3 bits per vertex (or 2.75 bits per vertex for meshes without valence-two vertices) and entropy-coding results for typical meshes ranging from 0.3 to 0.9 bits per vertex, depending on the regularity of the mesh. Our method may be implemented by a rule for a particular splitting of quads into triangles and by using the compression and decompression algorithms introduced in [Rossignac99] and [Rossignac&Szymczak99]. We also present extensions to the algorithm to compress meshes with holes and handles and meshes containing triangles and other polygons as well as quads.