Efficient Analysis of Complex Diagrams using ConstraintBased Parsing
Abstract
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the data make it possible to efficiently parse real diagrams of substantial complexity. The system is probably the first to demonstrate efficient diagram parsing using grammars that easily be retargeted to other domains. The work assumes that the diagrams are available as a flat collection of graphics primitives: lines, polygons, circles, Bezier curves and text. This is appropriate for future electronic documents or for vectorized diagrams converted from scanned images. The classes of diagrams that we have analyzed include x,y data graphs and genetic diagrams drawn from the biological literature, as well as finite state automata diagrams (states and arcs). As an example, parsing a fourpart data graph composed of 133 primitives required 35 sec using Macintosh Common Lisp on a Macintosh Quadra 700.
 Publication:

arXiv eprints
 Pub Date:
 May 1995
 arXiv:
 arXiv:cmplg/9505015
 Bibcode:
 1995cmp.lg....5015F
 Keywords:

 Computer Science  Computation and Language
 EPrint:
 9 pages, Postscript, no fonts, compressed, uuencoded. Composed in MSWord 5.1a for the Mac. To appear in ICDAR '95. Other versions at ftp://ftp.ccs.neu.edu/pub/people/futrelle