Surface Simplification Using Quadric Error Metrics
cs.cmu.edu · 6,145 words · saved by 1 readers
N/A
Surface Simplification Using Quadric Error Metrics Michael Garland∗ Paul S. Heckbert† Carnegie Mellon University Abstract We have developed an algorithm which produces simplified ver- sions of such polygonal models. Our algorithm is based on the iter- Many applications in computer graphics require complex, highly…
related reading
- dualContour.dvics.rice.edu
- Visualizing Delaunay Triangulationianthehenry.com
- TU Berlin | CG | Marc Alexacg.tu-berlin.de
- Good Vibrations.tifcs.toronto.edu
- Laplacian Mesh Editingpeople.eecs.berkeley.edu
- Why Momentum Really Worksdistill.pub
- Superquadrics Revisited: Learning 3D Shape Parsing beyond Cuboidsarxiv.org
- Meshing in a Minecraft Game – 0 FPS0fps.net
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- Announcing ScaNN: Efficient Vector Similarity Searchai.googleblog.com
- Optimizing Cubature for Efficient Integration of Subspace Deformationscs.cornell.edu
- fasticp_paper.pdfcs.princeton.edu