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

Authors

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

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.

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.

Downloads

Published

2023-07-13

Issue

Vol. 3 No. 3 (1996)
pp. 191-203

Section

Articles

License

Copyright © The Author(s).

This work is licensed under the Creative Commons Attribution 4.0 International CC BY 4.0.

How to Cite

Flasiński, M., & Schaefer, R. (2023). Quasi context sensitive graph grammars as a formal model of FE mesh generation. Computer Assisted Methods in Engineering and Science, 3(3), 191-203. https://cames3.ippt.pan.pl/index.php/cames/article/view/1440