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

Variable Resolution 4‐k Meshes: Concepts and Applications

Abstract: In this paper we introduce variable resolution 4‐k meshes, a powerful structure for the representation of geometric objects at multiple levels of detail. It combines most properties of other related descriptions with several advantages, such as more flexibility and greater expressive power. The main unique feature of the 4‐k mesh structure lies in its variable resolution capability, which is crucial for adaptive computation. We also give an overview of the different methods for constructing the 4‐k mesh repres… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0
2

Year Published

2005
2005
2019
2019

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 62 publications
(31 citation statements)
references
References 25 publications
0
29
0
2
Order By: Relevance
“…. , M k ), with increasing resolution, i.e., the mesh sizes, |M i | ≤ |M j |, for i < j and the meshes M i ∈ H are equivalent triangulations of a surface S. When a multiresolution mesh structure allows the resolution of the mesh to vary locally over the surface, it produces a variable-resolution triangulation [16]. The key to build mesh structures with this property is the ability to perform local refinement and simplification operations on the mesh.…”
Section: B Adaptive Multiresolution Meshesmentioning
confidence: 99%
“…. , M k ), with increasing resolution, i.e., the mesh sizes, |M i | ≤ |M j |, for i < j and the meshes M i ∈ H are equivalent triangulations of a surface S. When a multiresolution mesh structure allows the resolution of the mesh to vary locally over the surface, it produces a variable-resolution triangulation [16]. The key to build mesh structures with this property is the ability to perform local refinement and simplification operations on the mesh.…”
Section: B Adaptive Multiresolution Meshesmentioning
confidence: 99%
“…Progressive meshes (Hoppe, 1996) and binary multi-triangulations (Velho and Gomes, 2000) are examples of hierarchical data structures that can be built with these operators.…”
Section: Algorithm 5 Stellar Simplification Assign Quadrics To Verticmentioning
confidence: 99%
“…These schemes serve as the foundation of mesh adaptation frameworks, such as progressive meshes [15] and 4-K meshes [23].…”
Section: Related Workmentioning
confidence: 99%