2000
DOI: 10.1111/1467-8659.00406
|View full text |Cite
|
Sign up to set email alerts
|

External Memory View‐Dependent Simplification

Abstract: In this paper, we propose a novel external-memory algorithm to support view-dependent

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
30
0

Year Published

2001
2001
2013
2013

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 66 publications
(30 citation statements)
references
References 25 publications
(16 reference statements)
0
30
0
Order By: Relevance
“…To handle large data sets that do not fit in local memory, external memory view-dependent rendering algorithms were developed [12,13]. In addition, a simplification method that represents geometric details using bump maps was developed by Cohen et al [14] such that it used displacement mapping for NURB surfaces.…”
Section: Related Workmentioning
confidence: 99%
“…To handle large data sets that do not fit in local memory, external memory view-dependent rendering algorithms were developed [12,13]. In addition, a simplification method that represents geometric details using bump maps was developed by Cohen et al [14] such that it used displacement mapping for NURB surfaces.…”
Section: Related Workmentioning
confidence: 99%
“…We propose applying current multiresolution, viewing frustum culling and out-ofcore [3] techniques to 3D graphics rendering on mobile devices [1,6]. We present a client-server system that delivers simplified geometry to a PDA over a wireless connection.…”
Section: Rendering On Mobile Devicesmentioning
confidence: 99%
“…In [12], El-Sana and Chiang build an out-of-core multi-resolution model based on edge collapse, which is generated through the simplification algorithm described in Section 2.3, and targeted to support view-dependent rendering. The dependency relation among updates is represented as a binary forest of vertices, called a viewdependent tree.…”
Section: Methods Based On Clustering Of Atomic Updatesmentioning
confidence: 99%
“…El-Sana and Chiang [12] propose an algorithm that works on irregularly distributed data. They partition the mesh at full resolution into patches, where each patch is bounded by chains of edges of the triangle mesh.…”
Section: Algorithms Based On Space Partitioningmentioning
confidence: 99%