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
Hexahedral mesh generation via the dual
Full text PdfPdf (217 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the eleventh annual symposium on Computational geometry table of contents
Vancouver, British Columbia, Canada
Pages: 404 - 405  
Year of Publication: 1995
ISBN:0-89791-724-3
Authors
Steven Benzley
Ted D. Blacker
Scott A. Mitchell
Peter Murdoch
Timothy J. Tautges
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): 2,   Downloads (12 Months): 14,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

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/220279.220323
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
Pierre Rosenstiehl , Robert E. Tarjan, Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations, Journal of Algorithms, v.5 n.3, p.375-390, Sept. 1984  [doi>10.1016/0196-6774(84)90018-X]
 
2
Peter Murdoch, Steven Benzley, Ted D. Blacker and Scott A. Mitchell, A connectivity based method for representing and constructing allhexahedral finite element meshes, Part I: The spatial twist continuum. Submitted I,o Int. J. Numer. Methods Eng.
 
3
Timothy J. Tautges, Scott A. Mitchell and Ted D. Blacker, A connectivity based method for representing and constructing all-hexahedral finite element meshes, Part II: Whisker Weaving. Submitted to Int. j. Numer. Methods Eng.

CITED BY
David Eppstein, Linear complexity hexahedral mesh generation, Proceedings of the twelfth annual symposium on Computational geometry, p.58-67, May 24-26, 1996, Philadelphia, Pennsylvania, United States

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:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.8 Partial Differential Equations
          Subjects: Finite element methods


General Terms:
Algorithms

Collaborative Colleagues:
Steven Benzley: colleagues
Ted D. Blacker: colleagues
Scott A. Mitchell: colleagues
Peter Murdoch: colleagues
Timothy J. Tautges: colleagues

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