h a l f b a k e r yNaturally, seismology provides the answer.
add, search, annotate, link, view, overview, recent, by name, random
news, help, about, links, report a problem
browse anonymously,
or get an account
and write.
register,
|
|
|
Please log in.
Before you can vote, you need to register.
Please log in or create an account.
|
This is something I've wanted for a long time.
Every so often my work requires me to create 'boundary diagrams,' which are essentially block and connector diagrams which end up resembling a pile of spaghetti. I would think that somewhere out there there would be software that could simplify my diagram
to an orientation with the fewest number of crossings as possible, either in the printed circuitboard world or the advanced math
world, but I have yet to discover it.
I would want this software to read a Visio or Powerpoint 2-d creation, understand the nodes and connectors, resize the blocks at will to 'cheat' the crossings, move things around, etc. so that I'm guaranteed that my final display will be as simple as can be made in 2D space.
Game: Planarity
http://www.addictin....com/planarity.html Along milkfish's lines.. [jutta, Aug 29 2008]
Someone thinking about the same problem
http://blogs.msdn.c...twork-diagrams.aspx [jutta, Aug 29 2008]
Graphviz
http://www.graphviz.org/ Graphviz is open-source software that can arrange nodes for readability according to any of many layout algorithms. The base program only processes text files describing the nodes and connections, but there are some GUI programs that use Graphviz too. [Rory O'Kane, Jun 03 2017]
[link]
|
|
If only you could diagram this idea, maybe I could understand how it works. |
|
|
I've seen circuit board layout autorouting software that works extremely well, but generally requires at least 2 layers. |
|
|
Schematic capture software is more like what you describe, and can do some fairly sensible things with trace spacing, keep-aways, etc. |
|
|
Some companies simplify drawings by allowing "air lines" i.e. connections which are specified by matching lables on pins which are connected, but without traces shown. On a computer screen, nets can be clicked upon and change color to show connectivity. |
|
|
Some simulation environments start with "netlists" which are just lists of interconnections and components (blocks in your domain,) and can create schematics using rules. |
|
|
I'll be interested to see if someone comes up with a link for an existing system. |
|
|
"Yourdon". HP used to do a software product like this, to generate "bubble" state disgrams. Search under "CASE tools". |
|
|
Make a game out of it and have people solve them for you for free. Kind of like a small-scale Mechanical Turk. |
|
|
There used to be a demo with the Java Development Kit that did something similar to this, but the topology had to be quite simple. |
|
|
If someone did create this you would probably lose your job!! |
|
|
It turns out that the problem has no solution: such a walk does not exist. ~ Bridges of Konigsberg... |
|
|
I hope I wouldn't lose my job,
it consists of more than
drawing lines and boxes. Or
at least I used to think so...
hmmmm.... |
|
|
The problem is to find a planar graph that is isomorphic to any random graph that you may draw, if a planar one exists. I'm sure there are algorithms that do this, and if you google the terms above you may stumble upon one very quickly. |
|
|
Try Inkscape (open source vector drawing). |
|
|
I'd guess this is related to the travelling salesman problem, and likewise computationally difficult (the time required increasing exponentially with the complexity of the diagram) - particularly if you want the guaranteed simplest diagram. |
|
|
I didn't know Graphviz could do that. I'll have to look
into it some more. I have for a while wanted an EDA
tool where I could just write a netlist and it would
generate a schematic, because I find schematic capture
inefficient and annoying. Maybe Graphviz could help. |
|
|
We just re-read the title as "Botox Dialogical Synthesizer" which is rubbish but sounds suitably half-baked ... |
|
| |