Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-04-04
2006-04-04
Wassum, Luke S (Department: 2167)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C716S030000
Reexamination Certificate
active
07024419
ABSTRACT:
A visualization system and method for visualization of network data, which is data that represents elements and links between elements. The network data is converted into a data structure, which represents a grid arrangement of the elements, where each element is placed on an individual grid position of a lattice. The data structure is suitable for use by a graphics display. The visualization tool comprises a processing unit that generates an initial data structure which represents an initial grid arrangement of the elements. It then assigns a global value to this initial grid arrangement and employs a gradient method for converting the initial grid arrangement into another grid arrangement which has a decreased or an increased global value.
REFERENCES:
patent: 3617714 (1971-11-01), Kernighan et al.
patent: 4953106 (1990-08-01), Gansner et al.
patent: 5513124 (1996-04-01), Trimberger et al.
patent: 5640327 (1997-06-01), Ting
patent: 5930784 (1999-07-01), Hendrickson
patent: 5987470 (1999-11-01), Meyers et al.
patent: 5995114 (1999-11-01), Wegman et al.
patent: 6363518 (2002-03-01), Lee
patent: 6389418 (2002-05-01), Boyack et al.
patent: 2003/0120630 (2003-06-01), Tunkelang
patent: 0 903 693 (1999-03-01), None
patent: 0903693 (1999-03-01), None
patent: 1085693 (2001-03-01), None
patent: WO 99/63455 (1999-12-01), None
Fruchterman, T.M.J. and E.M. Reingold “Graph Drawing by Force-Directed Placement”, Software—Practice and Experience, vol. 21, pp. 1129-1164, Nov. 1991.
Tunkelang, D. “A Practical Approach to Drawing Undirected Graphs”, Technical Report CMU-CS-94-161, School of Computer Science, Carnegie Mellon University, Jun. 1994.
Di Battista, G, P. Eades, R. Tamassia and I.G. Tollis “Algorithms for Drawing Graphs: An Annotated Bibliography”, Technical Report, Brown University, Jun. 1994.
Cohen, R.F., P. Eades, T. Lin and F. Ruskey “Volume Upper Bounds for 3D Graph Drawing”, Proceedings of the 1994 Conference of the IBM Centre for Advanced Studies on Collaborative Research, 1994.
Monien, B., F. Ramme and H. Salmen “A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs”, Proceedings of the International Symposium on Graph Drawing (GD'95), pp. 396-408, 1995.
Garg, A. and R. Tamissia “GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D”, Proceedings of the Internationa Symposium on Graph Drawing (GD'96), Sep. 18-20, 1996.
Davidson, R. and D. Harel “Drawing Graphs Nicely Using Simulated Annealing”, ACM Transactions on Graphics, vol. 15, No. 4 pp. 301-331, Oct. 1996.
Coleman, M.K. and D.S. Parker “Aesthetics-Based Graph Layout for Human Consumption”, Software—Practice and Experienc vol. 26, No. 12, pp. 1415-1438, Dec. 1996.
Tunkelang, D. “JIGGLE: Java Interactive Graph Layout Environment”, Proceedings of the International Symposium on Graph Drawing (GD'98), pp. 413-422, 1998.
Tunkelang, D. “A Numerical Optimization Approach to General Graph Drawing”, PhD. Thesis, School of Computer Science, Carnegie Mellon University, CMU-CS-98-189, Jan. 1999.
Behzadi, L. “An Improved Spring-Based Graph Embedding Algorithm and LayoutShow: A Java Environment for Graph Drawing”, M.S. Thesis, Computer Science, York University, Ontario Canada, Jul. 1999.
Brandenburg, F.J. “Graph Drawing: Past, Present, Future”, University of Passau, powerpoint presentation, 82 slides, downloaded from www.csse.monash.edu.au/˜gfarr/research/GraphDrawing02-Mel.ppt, Oct. 2002.
Eades, P. “A Heuristic for Graph Drawing”, Congressus Numerantium, vol. 42, 1984, pp. 149-160.
Masui, T. “Graphic Object Layout with Interactive Genetic Algorithms”, Proceedings of the IEEE Workshop on Visual Language (VL92), Sep. 15-18, 1992, pp. 74-80.
Eloranta, T. and E. Makinen “TimGA—A Genetic Algorithm for Drawing Undirected Graphs”, Technical Report A-1996-10, University of Tampere (Finland), Department of Computer Science, Dec. 1996.
Schweikert, D.G. and B.W. Kernighan “A Proper Model for the Partitioning of Electrical Circuits”, Annual ACM IEEE Design Automation Conference, Proceedings of the 9thWorkshop on Design Automation, pp. 57-62, 1972.
European Search Report dated Oct. 29, 2003 issued in a counterpart application, namely, Appln. No. 00118557.8.
Coleman et al., “Aesthetics-Based Graph Layout for Human Consumption”, Software-Practice and Experience, vol. 26(12), pp. 1415-1438, Dec. 1996.
Davidson et al., “Drawing Graphs Nicely Using Simulated Annealing”, ACM Transactions on Graphics, vol. 15, No. 4, Oct. 1996, pp. 301-331.
Tunkelang, “JIGGLE: Java Interactive Graph Layout Environment”, GD'98, LNCS 1547, pp. 413-422, 1998.
Kamps et al., “Constraint-Based Spring-Model Algoithm for Graph Layout”, pp. 349-360.
Gupta et al., “Optimal Three-Dimensional Layouts of Complete Binary Trees”, Information Processing Letters 26 (1987/88), pp. 99-104.
Bienemann et al., “A Simulated Annealing Approach to the General Graph Layout Problem”, pp. 255-260, 1986.
Clarkson, Mark A.,An Easier Interface,Byte, Feb. 1991, pp. 277-282.
DiBattista, Giuseppe, et al.,An Experimental Comparison of Four Graph Drawing Algorithms,Computational Geometry, 1997, pp. 303-325.
Eades, Peter, et al.,An Algorithm for Drawing a Hierarchical Graph,International Journal of Computational Geometry & Applications, vol. 6, No. 2 (1996), pp. 145-155.
Robertson, George G., et al.,Information Visualization Using 3D Interactive Animation,Communications of the ACM, Apr. 1993, vol. 36, No. 4, pp. 57-71.
Klenk Juergen
Ziegler Patrick
International Business Machines Corp.
Karra, Esq. Satheesh
Wassum Luke S
LandOfFree
Network visualization tool utilizing iterative rearrangement... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Network visualization tool utilizing iterative rearrangement..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network visualization tool utilizing iterative rearrangement... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3542473