A Novel Page-Based Data Structure for Interactive Walkthroughs
description
Transcript of A Novel Page-Based Data Structure for Interactive Walkthroughs
![Page 1: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/1.jpg)
1
A Novel Page-Based Data Structure for Interactive
Walkthroughs
Behzad SajadiYan Huang
Pablo Diaz-GutierrezSung-Eui Yoon
M. Gopi
![Page 2: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/2.jpg)
2
Outline
Page-Based Rendering Data Fetching Algorithm 2-Factor Data Layout Implementation and Results Summary Conclusion and Future Work
![Page 3: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/3.jpg)
3
Traditional Rendering Workflow
2
365
7
1
4
8
![Page 4: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/4.jpg)
4
Page Based Rendering Workflow
2
3
1
4 65
78
![Page 5: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/5.jpg)
5
Page Format
Self contained information Less bytes for vertex indices Effective compression
# vertices# vertices # faces# faces List of vertices with attributes
List of vertices with attributes
Indexed triangle list with attributes
Indexed triangle list with attributes
![Page 6: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/6.jpg)
Eliminating fragment accesses
6
Traditional K-d tree Page based K-d tree
Storage
OScache
Processheap space
High data management
cost
No data management
cost
Low data management cost
![Page 7: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/7.jpg)
7
Major Steps of the Workflows
Traditional rendering workflow
Page based rendering workflow
SceneData
structureLayout
LayoutApproximated
sceneData
structure
![Page 8: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/8.jpg)
8
Advantages
Less space required for the data structure K-d tree on pages instead of triangles
Independence of the layout and data structure Any layout can be converted to the page
based format
![Page 9: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/9.jpg)
9
Outline
Page-Based Rendering Data Fetching Algorithm 2-Factor Data Layout Implementation and Results Summary Conclusion and Future Work
![Page 10: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/10.jpg)
10
Rendering Flow
K-d treestructure
RenderFetchdata
Page numbersafter VF Culling
Triangles
2
3
1
4
![Page 11: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/11.jpg)
11
Sorting the Page Numbers
Access pattern is based on storage
…
..
.
K-d tree without sorting
…
..
.
1,72,5 4,12 5,7 9,14 8,16
1, 2, 4, 5, 7, 8, 9, 12, 14, 16
K-d tree after sorting
1,72,5 4,12 5,7 9,14 8,16
![Page 12: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/12.jpg)
12
Rendering Flow
K-d treestructure
Sort pagenumbers
RenderFetchdata
Page numbersafter VF Culling
Triangles
1, 2, 4, 5
2
3
1
4
![Page 13: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/13.jpg)
13
Backface Culling
![Page 14: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/14.jpg)
14
Rendering Flow
K-d treestructure
Sort pagenumbers
RenderFetchdata
BackfaceCulling
Page numbersafter VF Culling
Triangles
1, 2, 4, 5
2
3
1
4
![Page 15: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/15.jpg)
15
Outline
Page-Based Rendering Data Fetching Algorithm 2-Factor Data Layout Implementation and Results Summary Conclusion and Future Work
![Page 16: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/16.jpg)
16
Related Works
Cache oblivious layout by Yoon et al. [2006]
Space filling curves Morton layout (Z-Order) Hilbert layout
![Page 17: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/17.jpg)
17
Graph Construction
Nodes: Group of triangles Edge weights: Distance between the
primitives of the nodes
23
2.5
41.8
6.7
5
5.3
85
![Page 18: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/18.jpg)
18
Steps of the Method
Use GLA (Generalized Lloyd's Algorithm) to partition the primitives
Use [Diaz-Gutierrez and Gopi 2005] to get a 2-factor
Iterate in a hierarchical manner
![Page 19: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/19.jpg)
19
The Layout Hierarchy
Ordering using2-Factor Layouts
Partitioning usingGLA clustering
1 23 4 5 6 7
Final Layout: 2 1 6 7 4 5 3
![Page 20: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/20.jpg)
20
Advantages
Operates globally Scalable Amenable for multiple proximity
measures
![Page 21: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/21.jpg)
21
Outline
Page-Based Rendering Data Fetching Algorithm 2-Factor Data Layout Implementation and Results Summary Conclusion and Future Work
![Page 22: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/22.jpg)
22
The City Model
Floor planned using role playing city map generator 5.40
![Page 23: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/23.jpg)
23
The City Model (Contd.)
3D models of houses and trees were replaced
Cars were added in the streets
![Page 24: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/24.jpg)
24
The City Model (Contd.)
Specifications 110 million triangles 90 million vertices Spans 4528 MB Around 10,000 objects 115 million vertices in page format Spans 3814 MB in page format
![Page 25: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/25.jpg)
25
Texture Based Simplification
[Aliaga and Lastra 1997]
![Page 26: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/26.jpg)
26
Statistics
Frame rates Raster scan layout: 20 FPS Cache oblivious layout by Yoon et al.
[2006]: 27 fps 2-factor layout: 28 FPS
Rendering statistics (our layout) Page size: 4 KB Average disk-page per frame: 2365 Average triangle per frame: 240 K
![Page 27: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/27.jpg)
27
Statistics (Contd.)
Computation times Page format conversion: 15 min (Offline) K-d tree construction: 5 min (Offline) Billboard rendering: 20 hour (Offline) Program initialization: 20 sec
Consumed memory Billboards: 640 MB K-d tree: 96 MB (including bounding
boxes and normal cones)
![Page 28: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/28.jpg)
28
![Page 29: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/29.jpg)
29
Outline
Page-Based Rendering Data Fetching Algorithm 2-Factor Data Layout Implementation and Results Summary Conclusion and Future Work
![Page 30: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/30.jpg)
30
Before Rendering (Offline) Steps
Given layoutConvert to thepage format
Construct thedisk-page hierarchy
2
3
1
4
![Page 31: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/31.jpg)
Rendering (Online) Steps
K-d treestructure
Sort pagenumbers
RenderFetchdata
BackfaceCulling
Page numbersafter VF Culling
Triangles
1, 2, 4, 5
2
3
1
4
![Page 32: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/32.jpg)
32
Outline
Page-Based Rendering Data Fetching Algorithm 2-Factor Data Layout Implementation and Results Summary Conclusion and Future Work
![Page 33: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/33.jpg)
33
Conclusion
A simple data structure on the disk pages Simplicity High Performance Generality
A new cache oblivious layout
![Page 34: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/34.jpg)
34
Future Work
Analyzing the disk-page hierarchy on other data structures
Exploring other applications that can make use of this data structure
Including simplification techniques Adding a cache management system Analyzing the number cache hits and
misses
![Page 35: A Novel Page-Based Data Structure for Interactive Walkthroughs](https://reader035.fdocuments.in/reader035/viewer/2022062520/56815b15550346895dc8c642/html5/thumbnails/35.jpg)
35
Questions?