Abstract
A software tool has been designed and developed for workstation applications. It is a library of functions based on a graph formalism, and consists of graph manipulation functions and visualization functions. It provides for a standard graph editor and performs animation of changing graph data. We describe the characteristics of this tool and illustrate an extended Petri net simulator and a prototype robot system as its applications. In the prototype robot system, the graph editor is used for robot data input and the formalized graph data structure is used for data manipulation, for example in 3D set operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D.S. Batory and A.P. Buchmann, “Molecular Objects, Abstract Data Types, and Data Models: A Framework,” Proc. of the 10-th Int. Conf. on VLDB, pp. 172–184, August 1984.
I.C. Braid, R.C. Hillyard, and I.A. Stroud, “Stepwise Construction of Polyhedra in Geometric Modelling,” in Mathematical Methods in Computer Graphics and Design, ed. K.E. Brodlie, 1980.
L Carlbom, “An Algorithm for Geometric Set Operations Using Cellular Subdivision Techniques,” IEEE CG & A, vol. 7, no. 5, pp. 44–55, May 1987.
I. Carlbom, I. Chakravarty, and D. Vanderschel, “A Hierarchical Data Structure for Representing the Spatial Decomposition of 3-D Objects,” IEEE CG & A, vol.5, no. 4, pp. 24–31, April 1985.
M.J. Durst and T.L. Kunii, “Integrated Polytrees: A Generalized Model for the Integration of Spatial Decomposition and Boundary Representation,” in Theory and Practice of Geometric Modelling, ed. H.P. Seidel, Springer-Verlag, Heiderberg, 1989.
R.E. Fikes and N.J. Nilsson, “STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving,” Artificial Intelligence, vol. 2, no. 3–4, pp. 189–208, Winter 1971.
K. Fujimura and T.L. Kunii, “A Hierarchical Space Indexing Methods,” in Computer Graphics (Proc. of Computer Graphics Tokyo’85), ed. T.L. Kunii, Springer-Verlag Tokyo, 1985.
E.P. Glinert and S.L. Tanimoto, “Pict: An Interactive Graphical Programming Environment,” IEEE Comp., vol.17, no. 11, pp. 7–25, 1984.
IEEE, “Visual Programming,” IEEE Comp., vol. 18, no. 8, August 1985.
C.L. Jacks and S.L. Tanimoto, “Oct-Trees and Their Use in Representing Three-Dimensional Objects,” Computer Graphics and Image Processing, vol. 14, pp. 249–270, 1980.
B.W. Kernighan and D.M. Ritchie, in The C Programming Language, Prentice-Hall, 1978.
T.L. Kunii and M. Harada, “SID: A System for Interactive Design,” NCC, 1980, pp. 33–40, 1980.
H. Kunii, “Graph Data Language: A High Level Access-Path oriented Language,” Ph.D. Dissertation, Department of Computer Science, the University of Texas at Austin, May 1983; also to be available as a book from Springer Verlag.
M. Mantyla and R. Sulonen, “GWB — A Solid Modeler with Euler Operators,” IEEE CG & A, vol. 2, no. 7, pp. 17–31, Sept. 1982.
D. Meagher, “Geometric Modeling Using Octree Encoding,” Computer Graphics and image Processing, vol. 19, pp. 129–147, 1982.
B.A. Myers, in Creating User Interfaces by Demonstration, Academic Press, INC., 1988.
M. Nagl, “A Software Development Environment based on Graph Technology,” in Graph-Grammers and their Application to Computer Science (Lecture Notes in Computer Science 291), ed. H. Ehrig et al., pp. 458–478, Springer-Verlag, 1986.
RICOH, in G-BASE Manual’s, ed. RICOH Co., Ltd., April 1988.
S.P. Reiss, “PECAN: Program Development Systems That Support Multiple Views,” IEEE Trans. on Softw. Eng., vol. 11, no. 3, pp. 276–285, 1985.
D.M. Ritchie and K. Thompson, “The Unix Time-Sharing System,” CACM, vol. 17, no. 7, pp. 365–375, July 1974.
R.V. Rubin, E.J. Golin, and S.P. Reiss, “ThinkPad: A Graphical System for Programming by Demonstration,” IEEE Software, pp. 73–78, 1985.
R.W. Scheifler and J. Gettrys, “The X window system,” ACM Trans. on Graphics, no. 2, April 1986.
N.C. Shu, in Visual Programming, Van Nostrand Reinhold Company, New York, 1988.
K. Sugiyama, S. Tagawa, and M. Toda, “Methods for visual understanding of hierarchical system structures,” IEEE Trans. on Systems, Man, and Cybernetics, vol. SMC-11, no. 109–125, Feb. 1981.
W. Teitelman and L. Masinter, “The Interlisp Programming Environment,” IEEE Comp., vol. 14, no. 4, pp. 25–34, 1981.
K. Yamaguchi, N. Inamoto, and T.L. Kunii, “A Data Flow Language for Controlling Multiple Interactive Devices,” IEEE CG & A, vol. 5, no. 3, pp. 48–60, Mar. 1985.
K. Yamaguchi, T.L. Kunii, K. Fujimura, and H. Toriya, “Octree-Related Data Structures and Algorithms,” IEEE CG & A, vol. 4, no. 1, pp. 53–59, Jan. 1984.
H. Yoshida, Protocol Specification Methodology based on the Extended Recursive Graph Formalism, Ph.D. Dissertation, Department of Information Science, the University of Tokyo, 1989.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Inamoto, N., Kunii, T.L. (1991). A Graph-Based Visual Tool for Workstations. In: Encarnação, J.L., Grinstein, G.G. (eds) Workstations for Experiments. IFIP Series on Computer Graphics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75903-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-75903-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-75905-5
Online ISBN: 978-3-642-75903-1
eBook Packages: Springer Book Archive