Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Level of detail

Known as: Continuous level of detail, Lots of ducks, Detail 
In Delgado , accounting for Level of detail involves decreasing the complexity of a 3D model representation as it moves away from the viewer or… Expand
Wikipedia

Related topics

Related topics

50 relations
3D city models3DelightBack-face cullingC4 Engine
Expand

Broader (1)

3D rendering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Level Of Detail For 3d Graphics
Thank you for downloading level of detail for 3d graphics. Maybe you have knowledge that, people have look numerous times for… Expand
Review
2014
Review
2014
Massive MIMO for next generation wireless systems
Multi-user MIMO offers big advantages over conventional point-to-point MIMO: it works with cheap single-antenna terminals, a rich… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2010
Highly Cited
2010
Aggregating local descriptors into a compact image representation
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Highly Cited
2010
Highly Cited
2010
On Single Image Scale-Up Using Sparse-Representations
This paper deals with the single image scale-up problem using sparse-representation modeling. The goal is to recover an original… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Review
2006
Review
2006
A Survey of Clustering Data Mining Techniques
  • P. Berkhin
  • Grouping Multidimensional Data
  • 2006
    • Corpus ID: 220665
Clustering is the division of data into groups of similar objects. In clustering, some details are disregarded in exchange for… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Highly Cited
2001
Highly Cited
2001
Topology matching for fully automatic similarity estimation of 3D shapes
There is a growing need to be able to accurately and efficiently search visual data sets, and in particular, 3D shape data sets… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Highly Cited
1998
Highly Cited
1998
A three-component scattering model for polarimetric SAR data
An approach has been developed that involves the fit of a combination of three simple scattering mechanisms to polarimetric SAR… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Highly Cited
1996
Highly Cited
1996
Real-time, continuous level of detail rendering of height fields
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1995
Highly Cited
1995
A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
For estimating the states or outputs of a Markov process, the symbol-by-symbol MAP algorithm is optimal. However, this algorithm… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1986
Highly Cited
1986
On the Plurality of Worlds.
Preface. 1. A Philosopher's Paradise. The Thesis of Pluraliry of Worlds. Modal Realism at Work: Modality. Modal Realism at Work… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE