Linear complexity hexahedral mesh generation

DOI10.1016/S0925-7721(98)00032-7zbMath0922.68120OpenAlexW2951898071MaRDI QIDQ1286469

David Eppstein

Publication date: 3 May 1999

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00032-7

zbMATH Keywords

hexahedral mesh generation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Refinable tri-variate \(C^1\) splines for box-complexes including irregular points and irregular edges ⋮ PERFORMANCE COMPARISON OF VARIOUS HEXAHEDRAL ELEMENT QUALITY METRICS VIA PARAMETRIC DISTORTION OF AN IDEAL ELEMENT ⋮ Efficiently hex-meshing things with topology ⋮ A 44-Element Mesh of Schneiders’ Pyramid ⋮ Surface cubications mod flips ⋮ A class of network optimization methods for planar grid generation ⋮ Construction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds ⋮ Combinatorial groupoids, cubical complexes, and the Lovász Conjecture ⋮ Quadrilateral and hexahedral mesh generation based on surface foliation theory ⋮ Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation

This page was built for publication: Linear complexity hexahedral mesh generation