Group Abstract Group Abstract

Message Boards Message Boards

The inverse of moving from a map to a network topology

POSTED BY: Seth Chandler
6 Replies

You are right, this method may not create a triconnected graph. I made a mistake. Here's a simple example:

Mathematica graphics

POSTED BY: Szabolcs Horvát

I appreciate the lucid code and explanation. Attached is a file showing that this method, though extremely helpful, may not work perfectly. In particular, it looks as if the IGSmoothen function may not always create a 3-connected graph which, as I understand it, is necessary for this method to work. There is also a substantial possibility that I am misunderstanding the concepts here. Any thoughts appreciated. I can also be reached offline via an email that you can surely figure out or via Wolfram Community,

Attachments:
POSTED BY: Seth Chandler
POSTED BY: Szabolcs Horvát

This is extremely helpful. What is g2 in the discussion above? Not seeing where you define it.

POSTED BY: Seth Chandler
POSTED BY: Szabolcs Horvát

What you describe sounds like the "dual graph", possibly excluding the exterior vertex and edges. If so, then the solution is the essentially the same as what you do to go from map to dual: treat vertices as planar faces, and edges as boundaries between those faces. Then use PlanarGraph to draw it.

POSTED BY: Daniel Lichtblau
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard