Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Many graphing applications use orthogonal edge routing for “objects” on a canvas.
I am aware of the brilliant collection of algorithms found in the open source project titled QuickGraph (http://quickgraph.codeplex.com/) but the layout is left to actual layout renderers (such as GraphViz (http://www.graphviz.org) and MSAGL (found on Microsoft store))
Is there a simple algorithm that takes into account the bounds of each object and the anchor points of the end and start points of an edge?
I’m not sure about the algorithm, but I know orthogonal routing (node link rendering, right?) is also called “Manhattan” layout, you may find something more about it under that name.