A grid-based algorithm for the generation of hexahedral element meshes

R Schneiders - Engineering with computers, 1996 - Springer
An algorithm for the generation of hexahedralelement meshes is presented. The algorithm
works in two steps: first the interior of the volume is filled with a regular grid; then the …

Quantized global parametrization

M Campen, D Bommes, L Kobbelt - Acm Transactions On Graphics (tog), 2015 - dl.acm.org
Global surface parametrization often requires the use of cuts or charts due to non-trivial
topology. In recent years a focus has been on so-called seamless parametrizations, where …

Hexahedral mesh generation by medial surface subdivision: Part I. Solids with convex edges

MA Price, CG Armstrong… - International Journal for …, 1995 - Wiley Online Library
A method is presented for subdividing a large class of solid objects into topologically simple
subregions suitable for automatic finite element meshing with hexahedral elements. The …

Hexahedral mesh generation by medial surface subdivision: Part II. Solids with flat and concave edges

MA Price, CG Armstrong - International Journal for Numerical …, 1997 - Wiley Online Library
A method is presented for the subdivision of a large class of solids into simple subregions
suitable for automatic finite element meshing with hexahedral elements. The medial surface …

Midsurface abstraction from 3D solid models: general theory and applications

M Rezayat - Computer-Aided Design, 1996 - Elsevier
An integral part of parallel product and process design is simulation through numerical
analysis. This so-called simulation-driven design process often requires abstraction (from …

Hexahedral meshing using midpoint subdivision and integer programming

TS Li, RM McKeag, CG Armstrong - Computer methods in applied …, 1995 - Elsevier
The generation of finite element meshes of 3D hexahedral elements can be performed by
subdividing the model into a number of simple bodies like hexahedra, triangular prisms, etc …

Partitioning surfaces into quadrilateral patches: A survey

M Campen - Computer graphics forum, 2017 - Wiley Online Library
The efficient and practical representation and processing of geometrically or topologically
complex shapes often demands a partitioning into simpler patches. Possibilities range from …

The spatial twist continuum: A connectivity based method for representing all-hexahedral finite element meshes

P Murdoch, S Benzley, T Blacker, SA Mitchell - Finite elements in analysis …, 1997 - Elsevier
This paper introduces the spatial twist continuum (STC), a powerful extension of the dual of
a hexahedral mesh. The STC captures the global connectivity constraints inherent in …

Quadrilateral mesh generation in polygonal regions

B Joe - Computer-Aided Design, 1995 - Elsevier
A method for generating quadrilateral finite element meshes in polygonal regions is
presented. The method uses geometric algorithms and is based partially on a triangular …

Automatic generation of multiblock decompositions of surfaces

HJ Fogg, CG Armstrong… - International Journal for …, 2015 - Wiley Online Library
Multiblock‐structured meshes have significant advantages over fully unstructured meshes in
numerical simulation, but automatically generating these meshes is considerably more …