Triangle-Mesh Simplification using Error Polyhedra

@inproceedings{Eastlick2001TriangleMeshSU,
  title={Triangle-Mesh Simplification using Error Polyhedra},
  author={Mark Eastlick and Steve Maddock},
  year={2001}
}
We present a novel and general framework for simpli fying triangle-meshes based on vertex decimation, as opposed to the common edge-collapse operation. Our basic simpli fication metric is based on the evaluation of the volume of error polyhedra; such a measure is the geometric analogue to the L1 norm between two functions. Unlike many other approaches, we perform triangulation in three-dimensions and utili se this extra information to increase simpli fication qualit y, dynamicall y making use… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

Triangle Mesh Simpli fication using Error Polyhedra , Department of Computer Science Technical Report , University of Sheff ield

  • M. Garland
  • 2001

Differential-Geometry Operators in nD, Multi Resolution Modelli

  • M. Desbrun, M. Meyer, P. Schröder
  • 2000

Fast and Memory Eff icient Polygonal Simpli fication

  • R. Ronfard, J. Rossignac
  • Full - Range Approximation of Triangulated…
  • 1998

Surface Simpli fication using Quadric Error Metrics, Computer Graphics

  • STAR, M. EuroGraphics ’99. Garland, P. Heckbert
  • 1997

Progressive Meshes, Computer Graphics

  • H. Hoppe
  • 1996

fornia Institute of Technology, pre-print

  • Group, Cali
  • Do Carmo, P
  • 1976

Similar Papers

Loading similar papers…