Linear complexity hexahedral mesh generation

Authors:
David Eppstein
Affiliations:
Department of Information and Computer Science, University of California, Irvine, CA
Venue:
Proceedings of the twelfth annual symposium on Computational geometry
Year:
1996

Compatible tetrahedralizations

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Bounds on the size of tetrahedralizations

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Automatic generation of hexahedral finite element meshes

Computer Aided Geometric Design - Special issue on grid generation, finite elements, and geometric design
Hexahedral mesh generation via the dual

Proceedings of the eleventh annual symposium on Computational geometry
A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed Volume

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science

Choosing corners of rectangles for mapped meshing

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Combinatorics helps for hexahedral mesh generation in CAD

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computational geometry

ACM SIGACT News
Small Convex Quadrangulations of Point Sets

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A class of network optimization methods for planar grid generation

Applied Numerical Mathematics
Volume subdivision based hexahedral finite element meshing of domains with interior 2-manifold boundaries

AFRIGRAPH '06 Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Boundary aligned smooth 3D cross-frame field

Proceedings of the 2011 SIGGRAPH Asia Conference

Hi-index	0.00