loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Geometric Modeling and Processing — Theory and Applications (GMP'02)
Polyhedra Operators for Mesh Refinement
Wako, Saitama, Japan
July 10-July 12
ISBN: 0-7695-1674-2
Ioannis Ivrissimtzis, Max-Planck Institut für Informatik
Hans-Peter Seidel, Max-Planck Institut für Informatik
We study the factorization of mesh refinement rules in terms of the polyhedra operators duality, stellation, truncation. Using this factorization, we show that the \sqrt{3}-refinement and the Leapfrog transformation, known from its applications in Discrete Mathematical Chemistry, differ by a conjugation by the duality operator. As an example of this relation we use a variational \sqrt{3}-scheme to draw the mesh of the fullerene molecule C60. We also find the relation between the simplest-scheme refinement and the binary refinement of the Catmull-Clark scheme.
Citation:
Ioannis Ivrissimtzis, Hans-Peter Seidel, "Polyhedra Operators for Mesh Refinement," gmp, pp.132, Geometric Modeling and Processing — Theory and Applications (GMP'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.