A divide-and-conquer algorithm for grid generation

DOI10.1016/0168-9274(94)90022-1zbMATH Open0803.65115OpenAlexW2053082143MaRDI QIDQ1330487FDOQ1330487

J. M. Hyman, Randall Dougherty

Publication date: 2 January 1995

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(94)90022-1

zbMATH Keywords

shape-preservinggrid generationdivide-and-conquer algorithmcubic Hermite interpolantmonotonicity-preserving

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonnegativity-, Monotonicity-, or Convexity-Preserving Cubic and Quintic Hermite Interpolation
• A divide-and-conquer algorithm for grid generation
• The numerical differentiation of discrete functions using polynomial interpolation methods

Cited In (9)

• A modified DIviding RECTangles algorithm for a problem in astrophysics
• A two-step grid redistribution method
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the generation of bipartite grids in 2 and 3 dimensional regions
• A new algorithm for generating tetrahedral grids
• A divide-and-conquer algorithm for grid generation
• An algorithm for aligning a quadrilateral grid with internal boundaries
• Splitting numbers of grids

This page was built for publication: A divide-and-conquer algorithm for grid generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330487)