메뉴 건너뛰기




Volumn 3, Issue 3, 1996, Pages 191-203

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL GRAMMARS; GRAPH THEORY; MATHEMATICAL MODELS;

EID: 0030386656     PISSN: 1232308X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (11)

References (15)
  • 1
    • 84945708842 scopus 로고
    • Indexed grammars - An extension of context-free grammars
    • A.V. Aho. Indexed grammars - an extension of context-free grammars. J. ACM 15: 647-671, 1968.
    • (1968) J. ACM , vol.15 , pp. 647-671
    • Aho, A.V.1
  • 2
    • 0020992473 scopus 로고
    • Graph grammars as a generative tool in image understanding
    • H.O. Bunke. Graph grammars as a generative tool in image understanding. Lecture Notes in Comp. Sci. 153: 8-19, 1982.
    • (1982) Lecture Notes in Comp. Sci. , vol.153 , pp. 8-19
    • Bunke, H.O.1
  • 4
    • 0024192972 scopus 로고
    • Parsing of edNLC-graph grammars for scene analysis
    • M. Flasiński. Parsing of edNLC-graph grammars for scene analysis. Pattern Recognition 21: 623-629, 1988.
    • (1988) Pattern Recognition , vol.21 , pp. 623-629
    • Flasiński, M.1
  • 5
    • 0024855656 scopus 로고
    • Characteristics of edNLC-graph grammars for syntactic pattern recognition
    • M. Flasiński. Characteristics of edNLC-graph grammars for syntactic pattern recognition. Comput. Vision Graphics Image Process. 47: 1-21, 1989.
    • (1989) Comput. Vision Graphics Image Process. , vol.47 , pp. 1-21
    • Flasiński, M.1
  • 6
    • 0025658245 scopus 로고
    • Distorted pattern analysis with the help of node labelled controlled graph languages
    • M. Flasiński. Distorted pattern analysis with the help of node labelled controlled graph languages. Pattern Recognition 23: 765-774, 1990.
    • (1990) Pattern Recognition , vol.23 , pp. 765-774
    • Flasiński, M.1
  • 7
    • 0027187617 scopus 로고
    • On the parsing of deterministic graph languages for syntactic pattern recognition
    • M. Flasiński. On the parsing of deterministic graph languages for syntactic pattern recognition. Pattern Recognition 26: 1-16, 1993.
    • (1993) Pattern Recognition , vol.26 , pp. 1-16
    • Flasiński, M.1
  • 8
    • 0029326772 scopus 로고
    • On the use of graph grammars for the description of mechanical parts
    • M. Flasiński. On the use of graph grammars for the description of mechanical parts. Computer Aided Design 27, 1995.
    • (1995) Computer Aided Design , vol.27
    • Flasiński, M.1
  • 12
    • 0014265483 scopus 로고
    • Mathematical models for cellular interactions in development
    • A. Lindenmayer. Mathematical models for cellular interactions in development. Journ. Theor. Biol. 18: 280-315, 1968.
    • (1968) Journ. Theor. Biol. , vol.18 , pp. 280-315
    • Lindenmayer, A.1
  • 14
    • 84919279214 scopus 로고
    • Programmed grammars and classes of formal languages
    • D.J. Rosenkrantz. Programmed grammars and classes of formal languages. J. ACM 16: 107-131, 1969.
    • (1969) J. ACM , vol.16 , pp. 107-131
    • Rosenkrantz, D.J.1
  • 15
    • 4243185431 scopus 로고
    • The fractal generator of FE meshes for 2D structures
    • Kielce, Poland: 11-14 May
    • T. Lukasiak, K.H. Zmijewski. The fractal generator of FE meshes for 2D structures. Proc. XI Pol. Conf. Comp. Meth. Mechanics. Kielce, Poland: 551-560, 11-14 May 1993.
    • (1993) Proc. XI Pol. Conf. Comp. Meth. Mechanics , pp. 551-560
    • Lukasiak, T.1    Zmijewski, K.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.