Skip to main content


And other TLAs (three-letter acronyms)...

So, in trying to find out what the status of the JChemPaint code, there seems to be a lot of stuff, but not all of it works. So, in order to understand the plan, and as a suggested architecture, have this diagram:

It's not proper UML, but the package symbols are right. What this sketch suggests is that if there is graphics-independant code in the cdk.renderer package, then this package would take a molecule (or a reaction set, or a chemobject, etc) and 'render' it into graphical objects.

These would then be passed (the "renderer objects" oval) to the package (n.b.cdk.jchempaint or o.o.jchempaint) that is actually using a Graphics or GC object to draw with. Otherwise, the renderer package is really doing nothing useful.


One thing to consider is that the input for the Renderer is not just IMolecule, but also things like IReaction.

In relation to this, we likely need rendering modules, which one can easily plugin in and out... for example, a module to draw reaction boxes, and electron movement arrows...

Now, a tree or list of rendering objects is a good idea, but we need to come up with a design which integrates well with such a modular design too...
gilleain said…
I saw the IRenderer2D interface methods (paintMoleculeSet, paintReactionSet, etc).

I suppose it might be nice to have these as modules, but I can't see the use-case for it. It seems like YAGNI applies:

But, I could be wrong...

In principle, there is no problem making the intermediate representation in a modular fashion, but at the moment the test implementation only renders bonds, rings, and atom symbols so there's a way to go :)
The alternative is to add many options to the Renderer2DModel, such as: drawReactionBoxes, drawElectronMovements, etc...

We do need this one way or another...

Popular posts from this blog

Generating Dungeons With BSP Trees or Sliceable Rectangles

So, I admit that the original reason for looking at sliceable rectangles was because of this gaming stackoverflow question about generating dungeon maps. The approach described there uses something called a binary split partition tree (BSP Tree) that's usually used in the context of 3D - notably in the rendering engine of the game Doom. Here is a BSP tree, as an example:

In the image, we have a sliced rectangle on the left, with the final rectangles labelled with letters (A-E) and the slices with numbers (1-4). The corresponding tree is on the right, with the slices as internal nodes labelled with 'h' for horizontal and 'v' for vertical. Naturally, only the leaves correspond to rectangles, and each internal node has two children - it's a binary tree.

So what is the connection between such trees and the sliceable dual graphs? Well, the rectangles are related in exactly the expected way:

Here, the same BSP tree is on the left (without some labels), and the slicea…

Common Vertex Matrices of Graphs

There is an interesting set of papers out this year by Milan Randic et al (sorry about the accents - blogger seems to have a problem with accented 'c'...). I've looked at his work before here.

[1] Common vertex matrix: A novel characterization of molecular graphs by counting
[2] On the centrality of vertices of molecular graphs

and one still in publication to do with fullerenes. The central idea here (ho ho) is a graph descriptor a bit like path lengths called 'centrality'. Briefly, it is the count of neighbourhood intersections between pairs of vertices. Roughly this is illustrated here:

For the selected pair of vertices, the common vertices are those at the same distance from each - one at a distance of two and one at a distance of three. The matrix element for this pair will be the sum - 2 - and this is repeated for all pairs in the graph. Naturally, this is symmetric:

At the right of the matrix is the row sum (∑) which can be ordered to provide a graph invarian…

Signatures with user-defined edge colors

A bug in the CDK implementation of my signature library turned out to be due to the fact that the bond colors were hard coded to just recognise the labels {"-", "=", "#" }. The relevant code section even had an XXX above it!

Poor show, but it's finally fixed now. So that means I can handle user-defined edge colors/labels - consider the complete graph (K5) below:

So the red/blue colors here are simply those of a chessboard imposed on top of the adjacency matrix - shown here on the right. You might expect there to be at least two vertex signature classes here : {0, 2, 4} and {1, 3} where the first class has vertices with two blue and two red edges, and the second has three blue and two red.

Indeed, here's what happens for K4 to K7:

Clearly even-numbered complete graphs have just one vertex class, while odd-numbered ones have two (at least?). There is a similar situation for complete bipartite graphs:

Although I haven't explored any more of these…