<EDIT> I knew something was wrong with my implementation, I have found my FDP implementation is not an accurate model of Peter Eade's heuristic, in that it is slightly more complex O(|V| x (|V| x |Tv|))*. Although complex, I will (eventually) run a few tests to compare output and runtime. NB: its my hypothesis that the visual results should remain the same, however, runtime will be faster than traditional spring-embedder implementations. Testing may be unnecessary but I would like some empirical evidence in case I am wrong.
*where V is the set of vertices and Tv is the neighbourhood of vertices for vertex v (degree of v?)</EDIT>
Two weeks of extensive reading (NB: below), but I have finally come up with an excuse as to why I haven't got any results of my work (or more correctly, my implementation of others work) yet. I have been unhappy with my implementations for many reasons, so I have been reading to ensure my understanding is correct, so to avoid so many differences between my results and the results of others. Moreover, in my reading, I am finding an understanding of how different techniques change results, and consequently, am getting ideas as to how I can create my own technique for drawing graphs.
(NB: I still only recognise one week, as the first week involved tinkering and playing with my code, and not much reading actually took place).
Once again I am beginning the week with reading, however, I am at a point where after I can tweak my system and begin offering results. I am intending to have compareable results towards the end of the week, and possibly part of a draft literature review (mostly pre-2000 paper reviews), but we shall see how it goes.
This is just a small update to notify readers of my continuation of reading and the likelihood of results. Other than that, have a happy Monday...
No comments:
Post a Comment