Japanese Writing: Kanji - PowerPoint PPT Presentation

About This Presentation
Title:

Japanese Writing: Kanji

Description:

Martin Isenburg Jack Snoeyink. University of North Carolina at Chapel Hill ... worst case time complexity: O(n) Spirale Reversi decoding algorithm. Overview ... – PowerPoint PPT presentation

Number of Views:694
Avg rating:3.0/5.0
Slides: 103
Provided by: Comp659
Learn more at: http://www.cs.unc.edu
Category:

less

Transcript and Presenter's Notes

Title: Japanese Writing: Kanji


1
(No Transcript)
2
SPIRALE REVERSI
Reverse Decoding of theEdgebreaker Encoding
Martin Isenburg Jack Snoeyink University
of North Carolina at Chapel Hill
3
Introduction
  • Mesh compression is hip
  • Edgebreaker encodes mesh connectivity
  • Original decoding algorithm
  • worst case time complexity O(n2)
  • Wrap Zip decoding algorithm
  • worst case time complexity O(n)
  • Spirale Reversi decoding algorithm

?
4
Overview
  • Connectivity Compression
  • Edgebreaker
  • Four Examples
  • Edgebreaker Encoding
  • Edgebreaker Decoding
  • Wrap Zip Decoding
  • Spirale Reversi Decoding
  • Holes and Handles

5
Connectivity Compression
6
Standard Representation
vertex1 (x,y,z) vertex2 (x,y,z) vertex3
(x,y,z) vertexn
triangle1 1 2 3 triangle2 3 4 3 triangle3
5 2 1 trianglem
7
Compression Schemes
  • Geometry Compression, Deering, 1995
  • Short Encodings of Planar Graphs and Maps, Keeler
    and Westbrook, 1995
  • Geometric Compression through Topological
    Surgery, Taubin and Rossignac, 1996
  • Good orders for incremental (re)construction,
    Snoeyink and vanKrefeld, 1997
  • Encoding a triangulation as a permutation of its
    point set, Denny and Sohler, 1997
  • Triangle Mesh Compression, Touma and Gotsman,
    1998
  • Real time compression of triangle mesh
    connectivity, Gumhold and Strasser, 1998
  • Mesh Connectivity Coding by Dual Graph Approach,
    Li and Kuo, 1998
  • Edgebreaker Connectivity Compression for
    Triangle Meshes, Rossignac, 1998
  • Mesh Collapse Compression, Isenburg and Snoeyink,
    1999
  • Single Resolution Compression of Arbitrary
    Triangular Meshes with Properties, Bajaj,
    Pascucci, and Zhuang, 1999
  • Triangle Strip Compression, Isenburg, 2000
  • Face Fixer Compressing Polygon Meshes with
    Properties, Isenburg and Snoeyink, 2000
  • Efficient Coding of non-triangular Meshes,
    Kronrod and Gotsman

8
Compression Schemes
time
  • Geometry Compression, Deering, 1995
  • Short Encodings of Planar
    Westbrook, 1995
  • Geometric Compression
    ubin and Rossignac, 1996
  • Good orders for increm
    nd vanKrefeld, 1997
  • Encoding a triangulation
    y and Sohler,
    1997
  • Triangle Mesh Compre
  • Real time compression
    d and Strasser,
    1998
  • Mesh Connectivity Co
    o, 1998
  • Edgebreaker Connectivity
    ossignac, 1998
  • Mesh Collapse Compressi
  • Single Resolution Compres
    hes with Properties,
    Bajaj, Pascucci, and Zhuang, 1999
  • Triangle Strip Compression, Isenburg, 2000
  • Face Fixer Compressing Polygon Meshes with
    Properties, Isenburg and Snoeyink, 2000
  • Efficient Coding of non-triangular Meshes,
    Kronrod and Gotsman

esh Connec
Edgebreaker
esh Collaps
9
Edgebreaker
10
Encoding
  • Encodes meshconnectivity asa sequence oflabels
  • Best worst casebound for meshconnectivity
  • Less than 4 bits per vertex for meshes without
    holes and handles

11
Decoding
  • Original decoding replays encoding traversal
  • but O(n2) worst case time complexity
  • Wrap Zip decoding sort of replays encoding
    traveral
  • only O(n) time complexity
  • but multiple traversals of labels (triangles) for
    mesh with boundary (handles)
  • zipping is un-necessary overhead

12
Edgebreaker Encoding
13












14























15






















16





















17




















18



















19



















20



















21
















22

















23
















24















25












26
EdgebreakerDecoding
27
  • Changes in boundary length
  • Computing initial boundary length

0
28
  • Changes in boundary length
  • Computing initial boundary length

1
1
0
29
  • Changes in boundary length
  • Computing initial boundary length

1
-1
1
0
0
30
  • Changes in boundary length
  • Computing initial boundary length

1
-1
-1
1
0
-1
0
31
  • Changes in boundary length
  • Computing initial boundary length

1
-1
-1
-1
1
0
-1
-2
0
32
  • Changes in boundary length
  • Computing initial boundary length

1
-1
-1
-1
-1
1
0
-1
-2
-3
0
33
  • Changes in boundary length
  • Computing initial boundary length

1
-1
-1
-1
-1
1
1
0
-1
-2
-3
-2
0
34
  • Changes in boundary length
  • Computing initial boundary length
  • Computing offset for label

1
-1
-1
-1
-1
1
1
0
-1
-2
-3
-2
0
0
35
  • Changes in boundary length
  • Computing initial boundary length
  • Computing offset for label

1
-1
-1
-1
-1
-1
1
1
0
-1
-2
-3
-3
-2
0
-1
0
36
  • Changes in boundary length
  • Computing initial boundary length
  • Computing offset for label

1
-1
-1
-1
-1
-1
-3
1
1
0
-1
-2
-3
-3
-6
-2
0
-1
-4
0
37
  • Changes in boundary length
  • Computing initial boundary length
  • Computing offset for label

1
-1
-1
-1
-1
-1
-3
1
1
1
0
-1
-2
-3
-3
-6
-5
-2
0
-1
-4
0
38
  • Changes in boundary length
  • Computing initial boundary length
  • Computing offset for label

1
-1
-1
-1
-1
-1
-3
-1
1
1
1
0
-1
-2
-3
-3
-6
-6
-5
-2
0
-1
-4
0
39
  • Changes in boundary length
  • Computing initial boundary length
  • Computing offset for label

1
-1
-1
-1
-1
-1
-3
-1
-1
1
1
1
0
-1
-2
-3
-3
-6
-7
-6
-5
-2
0
-1
-4
0
40
  • Changes in boundary length
  • Computing initial boundary length
  • Computing offset for label

1
-1
-1
-1
-1
-1
-3
-3
-1
-1
1
1
1
0
-1
-2
-3
-3
-6
-10
-7
-6
-5
-2
0
-1
-4
0
41




















42




















43






















44





















45




















46



















47


















48


















49


















50















51

















52
















53















54












55
Wrap ZipDecoding
56




















57




















58























59

























60



























61





























62






zip ...

























63




























64






























65
































66


































67




































68






































69








































70












zip ...






























71

zip ...






































72





zip ...































73





















zip ...












74






























75












76
Spirale ReversiDecoding
77
(No Transcript)
78






79








80









81









82















83

















84

















85

















86

















87

















88















89















90

















91



















92





















93























94






















95
Holes andHandles
96
Encoding a hole



























97
Encoding a hole

































98
Encoding a handle




























99
Encoding a handle




























100
Encoding a handle




























101
Yeez this bunny again!
102
Acknowledgements
  • Davis King for details on Edgebreaker during our
    pool session at SCG 99
  • Jarek Rossignac for suggesting the name Spirale
    Reversi
Write a Comment
User Comments (0)
About PowerShow.com