Hello,
I am exploring the notion that I could use batik to support a graph layout algorithm based on minimizing constraint error. Notionally, I would like to define reusable graphical patterns and apply them to sections of a directed graph based on characteristics associated with the nodes and edges of that graph. At the moment I am thinking in terms of RDF descriptions of the directed graph, but I am also interested in visualizing UML using a similar approach.
Layout requires iterative positioning of the origin of graphical elements whose size is not known until the bounding box of the element has been computed. This has led me to think of batik as a platform in which parameterized svg subgraphs could serve as patterns. When instantiated, the size of the subgraph could be computed. Subgraphs that are peers within a larger graph would then be laid out according by minimizing constraint error.
So, the layout algorithm would need to be able to compute the size of graphical elements, but it would not need to go as far as rendering those elements graphically. The output would be an svg document (not a rasterized image) comprised of the instantiated patterns in which the subgraphs were aligned to origins that minimized constraint error. The svg document could then be delivered to a browser or rasterized as necessary.
I would appreciate any advice on whether or not batik is well aligned with solving this problem and any suggested approaches in terms of the batik architecture.
Thanks for any advice,
-bryan
Bryan Thompson
Systems Architect
Hicks & Associates, Inc.
3811 N. Fairfax Drive, Suite 850
Arlington, VA 22203
+1 703-469-3409 (o)
+1 202-285-5099 (c)
[EMAIL PROTECTED]
