Interaction Design Foundation
Free educational materials - made by the world's technology elite
 
Join us on Linkedin
Join us on Twitter
Join us on Google plus
Get our RSS Feed
 
 
ReferencesNavigation arrowAuthorsNavigation arrowMartin Isenburg

Publication statistics

Pub. period:2000-2010
Pub. count:11
Number of co-authors:8



Co-authors

Number of publications with 3 favourite co-authors:

Peter Lindstrom:4
Stefan Gumhold:3
Craig Gotsman:2

 

 

Productive colleagues

Martin Isenburg's 3 most productive colleagues in number of publications:

Craig Gotsman:31
Peter Lindstrom:12
Stefan Gumhold:8
 
 
 
May 20

“ The moment clients realize that revisions are not an all-you-can-eat buffet, suddenly they realize they are not hungry. ”

-- Lester Beall

 
 

Featured chapter

Read the fascinating history of Wearable Computing, told by its father, Steve Mann

Read Steve's chapter !

 
 

Help us help you!

 
 

Martin Isenburg

Picture of Martin Isenburg. Copyright unknown.
Add description
Add publication

Publications by Martin Isenburg (bibliography)

 what's this?
2010
 
Edit | Del

Isenburg, Martin, Lindstrom, Peter and Childs, H. (2010): Parallel and Streaming Generation of Ghost Data for Structured Grids. In IEEE Computer Graphics and Applications, 30 (3) pp. 32-44.

2008
 
Edit | Del

Bogomjakov, Alexander, Gotsman, Craig and Isenburg, Martin (2008): Distortion-Free Steganography for Polygonal Meshes. In Comput. Graph. Forum, 27 (2) pp. 637-642.

2006
 
Edit | Del

Isenburg, Martin and Snoeyink, Jack (2006): Early-split coding of triangle mesh connectivity. In: Proceedings of the 2006 Conference on Graphics Interface 2006. pp. 89-97.

“The two main schemes for coding triangle mesh connectivity traverse a mesh with similar region-growing operations. Rossignac's Edgebreaker uses triangle labels to encode the traversal whereas the coder of Touma and Gotsman uses vertex degrees. Although both schemes are guided by the same spiraling spanning tree, they process triangles in a different order, making it difficult to understand their similarities and to explain their varying compression success. We describe a coding scheme that can operate like a label-based coder similar to Edgebreaker or like a degree-based coder similar to the TG coder. In either mode our coder processes vertices and triangles in the same order by performing the so-called "split operations" earlier than previous schemes. The main insights offered by this unified view are (a) that compression rates depend mainly on the choice of decoding strategy and less on whether labels or degrees are used and (b) how to do degree coding without storing "split" offsets. Furthermore we describe a new heuristic that allows the TG coder's bit-rates to drop below the vertex degree entropy.”

© All rights reserved Isenburg and Snoeyink and/or Canadian Information Processing Society

 
Edit | Del

Isenburg, Martin, Lindstrom, Peter, Gumhold, Stefan and Shewchuk, Jonathan (2006): Streaming compression of tetrahedral volume meshes. In: Proceedings of the 2006 Conference on Graphics Interface 2006. pp. 115-121.

“Geometry processing algorithms have traditionally assumed that the input data is entirely in main memory and available for random access. This assumption does not scale to large data sets, as exhausting the physical memory typically leads to IO-inefficient thrashing. Recent works advocate processing geometry in a "streaming" manner, where computation and output begin as soon as possible. Streaming is suitable for tasks that require only local neighbor information and batch process an entire data set. We describe a streaming compression scheme for tetrahedral volume meshes that encodes vertices and tetrahedra in the order they are written. To keep the memory footprint low, the compressor is informed when vertices are referenced for the last time (i.e. are finalized). The compression achieved depends on how coherent the input order is and how many tetrahedra are buffered for local reordering. For reasonably coherent orderings and a buffer of 10,000 tetrahedra, we achieve compression rates that are only 25 to 40 percent above the state-of-the-art, while requiring drastically less memory resources and less than half the processing time.”

© All rights reserved Isenburg et al. and/or Canadian Information Processing Society

2005
 
Edit | Del

Isenburg, Martin and Lindstrom, Peter (2005): Streaming Meshes. In: 16th IEEE Visualization Conference VIS 2005 23-28 October, 2005, Minneapolis, MN, USA. p. 30.

2003
 
Edit | Del

Isenburg, Martin, Lindstrom, Peter, Gumhold, Stefan and Snoeyink, Jack (2003): Large Mesh Simplification using Processing Sequences. In: Turk, Greg, Wijk, Jarke J. van and II, Robert J. Moorhead (eds.) 14th IEEE Visualization 2003 Conference VIS 2003 19-24 October, 2003, Seattle, WA, USA. pp. 465-472.

2002
 
Edit | Del

Isenburg, Martin (2002): Compressing Polygon Mesh Connectivity with Degree Duality Prediction. In: Graphics Interface 2002 May 27-29, 2002, Calgary, Alberta, Canada. pp. 161-170.

 
Edit | Del

Isenburg, Martin and Alliez, Pierre (2002): Compressing Polygon Mesh Geometry with Parallelogram Prediction. In: IEEE Visualization 2002 2002. .

2001
 
Edit | Del

Isenburg, Martin, Gumhold, Stefan and Gotsman, Craig (2001): Connectivity Shapes. In: Ertl, Thomas, Joy, Kenneth I. and Varshney, Amitabh (eds.) IEEE Visualization 2001 October 24-26, 2001, San Diego, CA, USA. .

 
Edit | Del

Isenburg, Martin (2001): Triangle Strip Compression. In Comput. Graph. Forum, 20 (2) pp. 91-101.

2000
 
Edit | Del

Isenburg, Martin (2000): Triangle. In: Proceedings of Graphics Interface 2000 May 15-17, 2000, Montreal, Quebec, Canada. pp. 197-204.

 
Add publication
Show this list on your homepage
 
 

Join the technology elite and advance:

 
1.

Your career

 
2.

Your network

 
 3.

Your skills

 
 
 
 
 
 

Changes to this page (author)

07 Nov 2012: Added
15 Feb 2010: Modified
21 Jul 2009: Added
21 Jul 2009: Added
14 Jun 2009: Added
14 Jun 2009: Added
14 Jun 2009: Added
14 Jun 2009: Added
23 Jun 2007: Added
23 Jun 2007: Added
28 Apr 2003: Added

Page Information

Page maintainer: The Editorial Team
URL: http://www.interaction-design.org/references/authors/martin_isenburg.html

Publication statistics

Pub. period:2000-2010
Pub. count:11
Number of co-authors:8



Co-authors

Number of publications with 3 favourite co-authors:

Peter Lindstrom:4
Stefan Gumhold:3
Craig Gotsman:2

 

 

Productive colleagues

Martin Isenburg's 3 most productive colleagues in number of publications:

Craig Gotsman:31
Peter Lindstrom:12
Stefan Gumhold:8
 
 
 
May 20

“ The moment clients realize that revisions are not an all-you-can-eat buffet, suddenly they realize they are not hungry. ”

-- Lester Beall

 
 

Featured chapter

Read the fascinating history of Wearable Computing, told by its father, Steve Mann

Read Steve's chapter !

 
 

Help us help you!

 
 
 
 
About | Press kit / Media kit | Copyright/IP Policy | General Terms of Use / General Site Terms and Conditions | Privacy Policy

How to help | Site Map

RSS Subscribe through an RSS feed
 
.