Linear complexity hexahedral mesh generation

David Eppstein
Computational Geometry Theory & Applications 12:3–16, 1999
Proc. 12th Symp. Computational Geometry, ACM, May 1996, pp. 58–67
Tech. report 95-51, Univ. of California, Irvine, Dept. of Information and Computer Science, 1995
ACM Computing Research Repository, cs.CG/9809109
Mathematical Reviews 2000a:68153
http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-51.pdf
http://www.ics.uci.edu/~eppstein/pubs/Epp-SCG-96.pdf

Cited by:

• Choosing corners of rectangles for mapped meshing
• Quadrilateral Mesh Generation in Computer-Aided Design
• Mesh generation
• Combinatorics helps for hexahedral mesh generation in CAD
• Hexahedral mesh generation by successive dual cycle elimination
• Reliable whisker weaving via curve contraction
• The all-hex geode-template for conforming a diced tetrahedral mesh to any diced hexahedral mesh
• Computational topology
• Improving the surface cycle structure for hexahedral mesh generation
• Hexahedral mesh generation for the simulation of the human mandible
• Computational geometry column 42
• Small strictly convex quadrilateral meshes of point sets
• A case study in hexahedral mesh generation: Simulation of the human mandible
• Shelling hexahedral complexes for mesh generation
• Compressing hexahedral volume meshes
• Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation
• A subdivision scheme for hexahedral meshes
• Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds
• Adaptive multiresolution and quality 3D meshing from imaging data
• A smooth subdivision scheme for hexahedral meshes
• Constructions of Cubical Polytopes