Quasi context sensitive graph grammars as a formal model of FE mesh generation

  • Mariusz Flasiński Jagiellonian University
  • Robert Schaefer Jagiellonian University

Abstract

Mathematical linguistics models that can be useful for controlling FE mesh generation are presented in the paper. The problems concerning an application of formal grammars for this purpose are outlined. Advantages and drawbacks related to the use of various types of Lindenmayer string/graph systems applied recently for FE mesh generation are discussed. An efficient (parsable) class of ETPL(k) graph grammars is proposed as a formal tool in this research area.

Keywords

References

[1] A.V. Aho. Indexed grammars - an extension of context-free grammars. J. ACM 15: 647- 671 , 1968.
[2] H.O. Bunke. Graph grammars as a generative tool in image understanding. Lecture Notes in Compo Sci. 153: 8- 19, 1982.
[3] K. Culik II, A. Lindenmayer. Graph 0L - systems and recurrence systems on graphs. Proc. 8th Conf. Systems Science, Hawaii, Jan. 1975.
[4] M. Flasiński. Parsing of edNLC-graph grammars for scene analysis. Pattern Recognition 21: 623- 629, 1988.
[5] M. Flasiński. Characteristics of edNLC-graph grammars for syntactic pattern recognition. Comput. Vision Graphics Image Process. 47: 1- 21, 1989.
Published
Jul 13, 2023
How to Cite
FLASIŃSKI, Mariusz; SCHAEFER, Robert. Quasi context sensitive graph grammars as a formal model of FE mesh generation. Computer Assisted Methods in Engineering and Science, [S.l.], v. 3, n. 3, p. 191-203, july 2023. ISSN 2956-5839. Available at: <https://cames.ippt.pan.pl/index.php/cames/article/view/1440>. Date accessed: 17 may 2024.
Citation Formats
Issue
Vol 3 No 3 (1996)
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.