A. Grbavec, D. Blostein, "Mathematics Rec. Using Graph Rewriting," Proc. ICDAR '95, 417-421. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Applying Compiler Techniques to Diagram Recognition - Blostein, Cordy, Zanibbi (2002) Self-citation (Blostein) (Correct)
....EXP machine COS PUSH X DIV I:ilure 1. Goreplier passes, for the input os(T 2) x . Figure 9. Example of inexact syrnbol placement: the 3 is placed hi9her than it would be in tpeset notation. The first system in our case study uses graph transformarion rules organized into four phases [16]. The initial graph contains one node per symbol, attributed with bounding box coordinates. The Build phase adds edges to represent Above, Below, Left, Sub, and Super relations. The Constrain phase removes contradictory edges, and determines the role of dots and horizontal lines. The Rank phase ....
A. Grbavec, D. Blostein, "Mathematics Rec. Using Graph Rewriting," Proc. ICDAR '95, 417-421.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC