Grid generation for 2D flow problems

Takeo Taniguchi, Klaus Peter Holz, Chikashi Ohta

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A grid generation method is proposed for an arbitrary two-dimensional domain. The method, based on the Delaunay triangulation, is modified so that it can be used as a grid generator for an arbitrary two-dimensional area with complex boundary geometry. Input data for the method are the co-ordinates of all nodes and the ordering of nodes on each boundary. Its efficiency is examined through a number of actual problems, and a numerical experiment clarifies that the grid generation requires a CPU time which is proportional to the number of nodes.

Original languageEnglish
Pages (from-to)985-997
Number of pages13
JournalInternational Journal for Numerical Methods in Fluids
Volume15
Issue number9
Publication statusPublished - Jan 1 1992

Fingerprint

Grid Generation
triangulation
Triangulation
Vertex of a graph
Program processors
generators
Delaunay triangulation
grids
Arbitrary
CPU Time
Geometry
geometry
Directly proportional
Numerical Experiment
Generator
Grid
Experiments

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Computational Mechanics
  • Mechanics of Materials
  • Safety, Risk, Reliability and Quality
  • Applied Mathematics
  • Condensed Matter Physics

Cite this

Taniguchi, T., Holz, K. P., & Ohta, C. (1992). Grid generation for 2D flow problems. International Journal for Numerical Methods in Fluids, 15(9), 985-997.

Grid generation for 2D flow problems. / Taniguchi, Takeo; Holz, Klaus Peter; Ohta, Chikashi.

In: International Journal for Numerical Methods in Fluids, Vol. 15, No. 9, 01.01.1992, p. 985-997.

Research output: Contribution to journalArticle

Taniguchi, T, Holz, KP & Ohta, C 1992, 'Grid generation for 2D flow problems', International Journal for Numerical Methods in Fluids, vol. 15, no. 9, pp. 985-997.
Taniguchi, Takeo ; Holz, Klaus Peter ; Ohta, Chikashi. / Grid generation for 2D flow problems. In: International Journal for Numerical Methods in Fluids. 1992 ; Vol. 15, No. 9. pp. 985-997.
@article{2f0c6d492f01482aa25d53e5cd7ff025,
title = "Grid generation for 2D flow problems",
abstract = "A grid generation method is proposed for an arbitrary two-dimensional domain. The method, based on the Delaunay triangulation, is modified so that it can be used as a grid generator for an arbitrary two-dimensional area with complex boundary geometry. Input data for the method are the co-ordinates of all nodes and the ordering of nodes on each boundary. Its efficiency is examined through a number of actual problems, and a numerical experiment clarifies that the grid generation requires a CPU time which is proportional to the number of nodes.",
author = "Takeo Taniguchi and Holz, {Klaus Peter} and Chikashi Ohta",
year = "1992",
month = "1",
day = "1",
language = "English",
volume = "15",
pages = "985--997",
journal = "International Journal for Numerical Methods in Fluids",
issn = "0271-2091",
publisher = "John Wiley and Sons Ltd",
number = "9",

}

TY - JOUR

T1 - Grid generation for 2D flow problems

AU - Taniguchi, Takeo

AU - Holz, Klaus Peter

AU - Ohta, Chikashi

PY - 1992/1/1

Y1 - 1992/1/1

N2 - A grid generation method is proposed for an arbitrary two-dimensional domain. The method, based on the Delaunay triangulation, is modified so that it can be used as a grid generator for an arbitrary two-dimensional area with complex boundary geometry. Input data for the method are the co-ordinates of all nodes and the ordering of nodes on each boundary. Its efficiency is examined through a number of actual problems, and a numerical experiment clarifies that the grid generation requires a CPU time which is proportional to the number of nodes.

AB - A grid generation method is proposed for an arbitrary two-dimensional domain. The method, based on the Delaunay triangulation, is modified so that it can be used as a grid generator for an arbitrary two-dimensional area with complex boundary geometry. Input data for the method are the co-ordinates of all nodes and the ordering of nodes on each boundary. Its efficiency is examined through a number of actual problems, and a numerical experiment clarifies that the grid generation requires a CPU time which is proportional to the number of nodes.

UR - http://www.scopus.com/inward/record.url?scp=0026947457&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026947457&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0026947457

VL - 15

SP - 985

EP - 997

JO - International Journal for Numerical Methods in Fluids

JF - International Journal for Numerical Methods in Fluids

SN - 0271-2091

IS - 9

ER -