Over the past few days I have been attempting to get a reasonably working implementation of Walshaw's multilevel drawing algorithm for static graphs, however, all attempts have been futile. After the program has finished (it should be noted, I am so needy that finishing successfully is regarded as an achievement), the coordinates for each vertex is Na, which experience suggests is due to singularities or problems with my multi-level implementation.
In the realm of checking for line segment intersection, I have done some research but not yet made anything. A pattern of finding the equation of the individual line segments and solving the last and first point of the lines for each and comparing the value between the lines, seems to pop up a lot. I will elaborate and discuss more when I'm comfortable with the process.
Next, LITERATURE! It's no surprise that whilst waiting for these lengthy applications to complete, my work is limited to guesswork and maintenance, so I have spent more time, this week, reading/note taking in preparation for the literature review.
For now, I hope this update shows my direction and (hopefully, by tomorrow) progress. [I have just been assaulted by a horde of students requesting help... interesting]. That's it for now I'm afraid, next update tomorrow (Friday) or Monday, possibly with some results worth mentioning.
PS. a picture I enjoy looking at, (what was a) dynamic single level force directed placement using Eades heuristic. Tried to export, or record to GIF but no luck so far. I enjoy watching the "snapping" effects as two vertices pass each other closely. Note the squashing of outside hexagons, you (I) should do something about that... don't forget.
No comments:
Post a Comment