Skip to main content

Multi-view

A quick example of a mini-application made using the new JChempaint renderer:

the picture is of an isomer space (C3H7NO), with compact mode on and atoms rendered as circles. The code is here, for now:

http://gist.github.com/70342

which is a kind of dumb way to achieve this, as it creates an instance of a renderer for each molecule, instead of adding them to a molecule set, and then laying that out...

edit: just realised; it's rendering the hydrogens as compact black circles :(

edit2: Ahhh. that's better:



edit3: Ha! This was a mistake, but it looks kind of cool:

Comments

Rajarshi said…
Very cool. From your description I understand that it'd be possible to layout multiple molecules with a single renderer? Does this mean it can layout disconnected components? Or should that be done by splitting it up and supplying it as a 2 item IMoleculeSet?
I just wondered if this might be a better molecular table for Bioclipse... I know the traditional spreadsheet approach, with structures and properties in rows...

But Bioclipse actually has a Properties View, so why not show a table like yours, and just have all the properties stay i nthe Properties View...
gilleain said…
Rajarshi: It's possible to render disconnected atom containers, or molecule sets. However, the renderer will not lay them out.

A nice (future!) project would be to make layout managers - probably using the same command design pattern as java does (LayoutManager).

Egon: Maybe, maybe not. When you get very large numbers, there's not much difference between 5 columns of 100 rows and one column and 500 rows.

Well, okay, so the difference is 400, but still.

Oh, now I see. The properties for each item would be down below. Hmmm.
Abhishek Tiwari said…
Aha, I am impressed with this blog, I just added this on my list of blogs about bioinformatics and chemoinformatics programming-

http://www.abhishek-tiwari.com/2009/02/30-blogs-about-bioinformatics-and.html
Gilleain, or on the left or right side... you choose :)

Popular posts from this blog

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…

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…

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…