1993
DOI: 10.1142/9789812797919_0051
|View full text |Cite
|
Sign up to set email alerts
|

A Heuristic Driven Parser Based on Graph Grammars for Feature Recognition in CIM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

1996
1996
2005
2005

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…In the layout of a hierarchical graph, node nesting is often used to depict the hierarchy visually; if multiple hierarchies are present, they can be distinguished through node shape, color, line type, or annotation [Hare88] [SiGJ93]. Internally, the hierarchical nature of the graph can be represented using edges with special labels, by collecting nodes into super-nodes [MaKl92], or by using labels that themselves are complex objects such as graphs [Schn93].…”
Section: Hierarchical Graphsmentioning
confidence: 99%
“…In the layout of a hierarchical graph, node nesting is often used to depict the hierarchy visually; if multiple hierarchies are present, they can be distinguished through node shape, color, line type, or annotation [Hare88] [SiGJ93]. Internally, the hierarchical nature of the graph can be represented using edges with special labels, by collecting nodes into super-nodes [MaKl92], or by using labels that themselves are complex objects such as graphs [Schn93].…”
Section: Hierarchical Graphsmentioning
confidence: 99%
“…Collin et al interpret dimensions in engineering drawings using a plex-grammar parser that mixes top-down and bottom-up processing [CoTV93]. A chart-based parser for hierarchical graphs is discussed in [MaKl92]. More recently, Klauck reports on a heuristically-driven chart parser and it's application to CAD/CAM [Klau94].…”
Section: Graph Grammarsmentioning
confidence: 99%
“…There is significant interest in the topic of hierarchical graph rewriting. Relevant references include a chart-based parser for hierarchical-graphs [MaKl92]; abstract graphs in a prototype algebraic-rewrite environment [LöBe93]; graphs where node labels can be graphs themselves [Schn93]; flat host-graph structure with hierarchy-expressing rewriting rules used to zoom in and out [EhHK92] and to manage and display a derivation [Hims94]; use of hierarchical graphs in a formal approach to plan generation [ArJa94]; use of hierarchically distributed graph transformations [Taen94].…”
Section: Mrs Maggraphen: Can Hierarchical Graphs Be Rewritten?mentioning
confidence: 99%