1993
DOI: 10.1016/0168-874x(93)90064-w
|View full text |Cite
|
Sign up to set email alerts
|

Mesh generation and refinement for FEM and BEM— A bibliography (1990–1993)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

1995
1995
2014
2014

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 182 publications
0
5
0
Order By: Relevance
“…Surveys of the literature in FEM include articles by Noor and Babus Ïka (1987), Oden and Demkovicz (1989), Haque (1992a, b), Babus Ïka andSuri (1994), and Ainsworth and Oden (1997). Mackerle (1993Mackerle ( , 1994 Zienkiewicz and Taylor (1989) includes a Chapter on``Error Estimation and Adaptivity'' (Chapter 14), which is supplemented by the papers by Zhu (1992a, b, 1994). Moreover, the book by Szabo  and Babus Ïka (1991) is primarily dedicated to this subject.…”
Section: Motivation and Related Workmentioning
confidence: 98%
“…Surveys of the literature in FEM include articles by Noor and Babus Ïka (1987), Oden and Demkovicz (1989), Haque (1992a, b), Babus Ïka andSuri (1994), and Ainsworth and Oden (1997). Mackerle (1993Mackerle ( , 1994 Zienkiewicz and Taylor (1989) includes a Chapter on``Error Estimation and Adaptivity'' (Chapter 14), which is supplemented by the papers by Zhu (1992a, b, 1994). Moreover, the book by Szabo  and Babus Ïka (1991) is primarily dedicated to this subject.…”
Section: Motivation and Related Workmentioning
confidence: 98%
“…One of the most dicult problems in the pre-processing stage of numerical analyses is the discretization of the continuous physical problem by a grid. 1 This problem is known as mesh generation. The problem becomes more dicult as the domain of the problem becomes more complicated Ð for example, a non-simple tie domain with many cavities and subdomains.…”
Section: Introductionmentioning
confidence: 99%
“…Although signiÿcant progress has been made in three-dimensional (3-D) meshing algorithms (see, e.g. Reference [1]), the task of meshing a 3-D object with complicated geometry can be arduous, time consuming, computationally cumbersome and expensive. Such shortcomings are greatly ampliÿed when one considers problems with changing geometry such as crack propagation, ÿnite deformation, phase change or shape optimization.…”
Section: Introductionmentioning
confidence: 99%