Generating Levels of Detail for Large-Scale Polygonal Models

@inproceedings{Varshney1995GeneratingLO,
  title={Generating Levels of Detail for Large-Scale Polygonal Models},
  author={Amitabh Varshney and Frederick P. Brooks and Hans Weber and Pankaj K. Agarwal and William V. Wright},
  year={1995}
}
We present an eecient algorithm for generating various levels-of-detail approximations for a given polygonal model. Our algorithm guarantees that all points of an approximation are within a user-speciiable distance from the original model and all points of the original model are within a distance from the approximation. Each approximation attempts to minimize the total number of polygons required to satisfy the previous constraint. We show how the problem of generating levels-of-detail… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES

Geometric optimization

  • Proceedings Visualization '93
  • 1993
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Re-tiling polygonal surfaces

  • SIGGRAPH
  • 1992
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Almost optimal set covers in finite VC-dimension

  • Discrete & Computational Geometry
  • 1995
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Computers and Intractability: A Guide to the Theory of NP-Completeness

Michael Randolph Garey, David S. Johnson
  • 1978
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Geometric simpli cation for indirect illumi- nation calculations

H. E. Rushmeier, C. Patterson, A. Veerasamy
  • Proceedings Graphics Interface '93, pages 227{236,
  • 1993
VIEW 1 EXCERPT