0
$\begingroup$

In a force-based graph-layout simulation using Barnes-Hut, what are the conditions for collapse? With collapse I mean multiple (or even all) nodes "collapsing" into a single point. Is there some research I could look into? Any hint is appreciated.

Background: We've written a force simulation to compute a graph-layout. But when running the simulation a bit too long all nodes of the graph collapse into a (or a few) single point(s). Here You can see a grid of 16 successful simulation runs, and afterwards a collapse, where we chose the parameters a little bit differently.

Improve this question
$\endgroup$
8
  • $\begingroup$ Implementation details of computational tasks are off-topic on this site: “While computational physics is on topic, we are not a programming site. If your question is about implementing computational code - in particular, if it's about writing, compiling, debugging or optimizing code, or about a specific language or library - then it is off topic.” $\endgroup$
    – Ghoster
    Commented May 2 at 20:19
  • $\begingroup$ This might be on-topic at Computational Science Stack Exchange. $\endgroup$
    – Ghoster
    Commented May 2 at 20:22
  • 1
    $\begingroup$ You haven’t said anything about the force that you’re simulating. For a reader to understand this, they should not have to read any code, since code is what’s off-topic. $\endgroup$
    – Ghoster
    Commented May 2 at 20:26
  • $\begingroup$ You have presumably implemented some always-repulsive force to keep the vertices apart. If they are instead collapsing, then either you have a bug in the force law or you have a bug in the way that you are moving the vertices under the influence of the force. $\endgroup$
    – Ghoster
    Commented May 2 at 23:48
  • $\begingroup$ Can you repro the problem with just a few vertices? If so, that should make it much easier to debug. $\endgroup$
    – Ghoster
    Commented May 2 at 23:51

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.