ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Edgewise subdivision of a simplex
Full text PdfPdf (698 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the fifteenth annual symposium on Computational geometry table of contents
Miami Beach, Florida, United States
Pages: 24 - 30  
Year of Publication: 1999
ISBN:1-58113-068-6
Authors
Herbert Edelsbrunner  Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois and Raindrop Geomagic, Champaign, Illinois
Daniel R. Grayson  Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, Illinois
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/304893.304897
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Bey, Tetrahedral grid refinement, Computing, v.55 n.4, p.355-378, 1995  [doi>10.1007/BF02238487]
 
2
H. S. M. COXETER. Discrete groups generated by reflections. Ann. of Math. 6 (1934), 13-29.
3
Tony DeRose , Michael Kass , Tien Truong, Subdivision surfaces in character animation, Proceedings of the 25th annual conference on Computer graphics and interactive techniques, p.85-94, July 1998  [doi>10.1145/280814.280826]
 
4
H. FREUDENTHAL. Simplizialzerlegung von beschr#nkter Flachheit. Ann. Math. 43 (1942), 580-582.
 
5
D. R. GRAYSON. Exterior power operations in higher K-theory. K-Theory 3 (1989), 247-260.
 
6
H. W. KUHN. Some combinatorial lemmas in topology. 1BM J. Res. Dev. 45 (1960), 518-524.
 
7
Anwei Liu , Barry Joe, Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision, Mathematics of Computation, v.65 n.215, p.1183-1200, July 1996  [doi>10.1090/S0025-5718-96-00748-X]
 
8
D. W. MOORE. Simplicial Mesh Generation with Applications. Rept. 92-1322, Dept. Comput. Sci., Cornell Univ., Ithaca, New York, 1992.
 
9
V. N. PARTHASARATHY. On tetrahedron shape distortion measures, internat. J. Numer. Methods Engrg., 1991.
 
10
M. SENECHAL. Which tetrahedra fill space? Math. Mag. 54 (1981), 227-243.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS


General Terms:
Algorithms, Theory, Verification


Keywords:
mesh generation, simplex shape, subdivision, symmetry, tiling

Collaborative Colleagues:
Herbert Edelsbrunner: colleagues
Daniel R. Grayson: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player