Linear complexity hexahedral mesh generation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Linear complexity hexahedral mesh generation

Full text

Pdf (1.09 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the twelfth annual symposium on Computational geometry table of contents

Philadelphia, Pennsylvania, United States

Pages: 58 - 67

Year of Publication: 1996

ISBN:0-89791-804-5

Author

David Eppstein

Department of Information and Computer Science, University of California, Irvine, CA

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): 9, Downloads (12 Months): 35, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237218.237237 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	S. E. Benzley, E. Perry, K. Merkley, B. Clark, and K. Sjaardema. A comparison of allhexahedral and all-tetrahedral finite element meshes for elastic and elasto-plastic analysis. 4th Int. Meshing Roundtable (1995) 179-191.
	2	Marshall Bern, Compatible tetrahedralizations, Proceedings of the ninth annual symposium on Computational geometry, p.281-288, May 18-21, 1993, San Diego, California, United States [doi>10.1145/160985.161151]
	3	M. Bern and D. Eppstein. Mesh generation and optimal triangulation. Computing in Euclidean Geometry, 2nd ed., World Scientific (1995) 47-123.
	4	Bernard Chazelle , Nadia Shouraboura, Bounds on the size of tetrahedralizations, Proceedings of the tenth annual symposium on Computational geometry, p.231-239, June 06-08, 1994, Stony Brook, New York, United States [doi>10.1145/177424.177975]
	5	E. Iteighway. A mesh generator for automatically subdividing irregular polygons into quadrilaterals. IEEE Trans. Magnetics 19, 6 (1983) 2535-2538.
	6	G. Hetyai. On the Stanley ring of a cubical complex. Disc. Comp. Geom. 14 (1995) 305- 330.
	7	E. F. Johnston, J. M. Sullivan, and A. Kwasnik. Automatic conversion of triangular finite meshes to quadrilateral elements. Int. J. Numerical Methods in Engineering 31 (1991) 67- 84.
	8	Steven Benzley , Ted D. Blacker , Scott A. Mitchell , Peter Murdoch , Timothy J. Tautges, Hexahedral mesh generation via the dual, Proceedings of the eleventh annual symposium on Computational geometry, p.404-405, June 05-07, 1995, Vancouver, British Columbia, Canada [doi>10.1145/220279.220323]
	9	S. Mitchell. A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume, 5th MSI Worksh. Computational Geometry, 1995. Available online at ftp: //ams.sunysb.edu/pub/geometry/msiworkshop / 95 / s amit ch.p s.gz.
	10	S. Ramaswami, P. Ramos, and G. Toussaint. Converting triangulations to quadrangulations. 7th Canad. Conf. Comp. Geom., 1995. Available online at http://www.uqac.uquebec.ca/DIM/ prof/jmrobert/Proceedings/go dfried.p s.gz.
	11	Robert Schneiders , Rolf Bünten, Automatic generation of hexahedral finite element meshes, Computer Aided Geometric Design, v.12 n.7, p.693-707, Nov. 1995 [doi>10.1016/0167-8396(95)00013-V]
	12	R. Schneiders. Open problem. Manuscript, available online at http://www-users'inf~rmatik'rwthaachen.de / Nrob er t s / op en.ht ml.
	13	W. Thurston. Hexahedral decomposition of polyhedra. Posting to sci.math, 25 Oct 1993. Available online at http://www.ics.uci.edu/ ,,~ep p s tein / gin a / Thur s t on- hex ah edra.

CITED BY 5

	Scott A. Mitchell, Choosing corners of rectangles for mapped meshing, Proceedings of the thirteenth annual symposium on Computational geometry, p.87-93, June 04-06, 1997, Nice, France
	Matthias Müller-Hannemann, Combinatorics helps for hexahedral mesh generation in CAD, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.949-950, January 17-19, 1999, Baltimore, Maryland, United States
	Joseph S. B. Mitchell , Joseph O'Rourke, Computational geometry, ACM SIGACT News, v.32 n.3, p.63-72, 09/01/2001
	N. Egidi , P. Maponi, A class of network optimization methods for planar grid generation, Applied Numerical Mathematics, v.52 n.4, p.363-379, March 2005
	Chandrajit L. Bajaj , Lalit C. Karlapalem, Volume subdivision based hexahedral finite element meshing of domains with interior 2-manifold boundaries, Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa, January 25-27, 2006, Cape Town, South Africa