Planarity, previously posted by Speff.

[Genome]

http://www.planarity.net/

It's got updated, perhaps due to interested people having a play with it.
You also get a PayPal link to donate a bit of money.

Now, I don't know about the underlying stuff but if I had to program one
then I would generate a n by m matrix and make random connections with
neighbours then I would randomly smear them about in a thing and then I just
have to think about equations for lines having same solutions.

Obviously my head would explode before I managed to code it.

DNA

 

[john jardine]

"Genome" <ilike_spam@yahoo.co.uk> wrote in message
news:4uoIe.22835$Fx3.685@newsfe7-gui.ntli.net...

http://www.planarity.net/

It's got updated, perhaps due to interested people having a play with it.
You also get a PayPal link to donate a bit of money.

Now, I don't know about the underlying stuff but if I had to program one
then I would generate a n by m matrix and make random connections with
neighbours then I would randomly smear them about in a thing and then I
just
have to think about equations for lines having same solutions.

Obviously my head would explode before I managed to code it.

DNA


This time only 1k points to level 10

Seems best if I just take each node in turn and locate it at it's physical
centre of gravity wrt the other connected nodes. Iterate round a few times
until stability ensues, then look for smallest three node triangles, reduce
these to a minimum physical area and iterate out from there with the
triangles being regarded as individual nodes. Gets boring as there is always
many solutions.
Kind of thing a computer is good at.
regards
john

 

[legg]

On Fri, 5 Aug 2005 01:09:13 +0100, "john jardine"
<john@jjdesigns.fsnet.co.uk> wrote:

"Genome" <ilike_spam@yahoo.co.uk> wrote in message
news:4uoIe.22835$Fx3.685@newsfe7-gui.ntli.net...
http://www.planarity.net/

It's got updated, perhaps due to interested people having a play with it.
You also get a PayPal link to donate a bit of money.

Now, I don't know about the underlying stuff but if I had to program one
then I would generate a n by m matrix and make random connections with
neighbours then I would randomly smear them about in a thing and then I
just
have to think about equations for lines having same solutions.

Obviously my head would explode before I managed to code it.

DNA


This time only 1k points to level 10
Seems best if I just take each node in turn and locate it at it's physical
centre of gravity wrt the other connected nodes. Iterate round a few times
until stability ensues, then look for smallest three node triangles, reduce
these to a minimum physical area and iterate out from there with the
triangles being regarded as individual nodes. Gets boring as there is always
many solutions.
Kind of thing a computer is good at.

Only 'if' programmed, by somebody that knows how. Cad autorouters can
provide humorous examples of the 'if' and the 'if not' condition. A
computer's only strength is in the ability to make lots of iterations,
very fast, no matter how silly each one might be.

Gigo.

The site seems to be Mozilla-unfriendly (v1.3.1), as the examples are
oversized, with information outside the windows' margins, including
the window resizing points.

 

[Bob Monsen]

john jardine wrote:

"Genome" <ilike_spam@yahoo.co.uk> wrote in message
news:4uoIe.22835$Fx3.685@newsfe7-gui.ntli.net...

http://www.planarity.net/

It's got updated, perhaps due to interested people having a play with it.
You also get a PayPal link to donate a bit of money.

Now, I don't know about the underlying stuff but if I had to program one
then I would generate a n by m matrix and make random connections with
neighbours then I would randomly smear them about in a thing and then I

just

have to think about equations for lines having same solutions.

Obviously my head would explode before I managed to code it.

DNA



This time only 1k points to level 10
Seems best if I just take each node in turn and locate it at it's physical
centre of gravity wrt the other connected nodes. Iterate round a few times
until stability ensues, then look for smallest three node triangles, reduce
these to a minimum physical area and iterate out from there with the
triangles being regarded as individual nodes. Gets boring as there is always
many solutions.
Kind of thing a computer is good at.
regards
john

I found that a better way to proceed, at least for me, was to just start
in on a corner, after using the 'center of gravity' thing to clear 1/4
of the ring. After that, I just pull one of the points over, and start
bringing over connected ones. It is actually fairly simple, much simpler
than what is required of an autorouter, I think. The maximum number of
edges is only 4 or 5.

I _would_ like a way to pick up and move a set of points, though.

It's kinda like trying to unravel a big kite string wind knot...

--
Regards,
Bob Monsen

If a little knowledge is dangerous, where is the man who has
so much as to be out of danger?
Thomas Henry Huxley, 1877

 

[Rich Grise]

On Thu, 04 Aug 2005 13:11:28 +0000, Genome wrote:

http://www.planarity.net/

It's got updated, perhaps due to interested people having a play with it.
You also get a PayPal link to donate a bit of money.

Now, I don't know about the underlying stuff but if I had to program one
then I would generate a n by m matrix and make random connections with
neighbours then I would randomly smear them about in a thing and then I just
have to think about equations for lines having same solutions.

Obviously my head would explode before I managed to code it.

With Konqueror, Epiphany, Galeon, and Mozilla, the majority of the
diagram is outside the box. I can only get to 1 1/2 blue dots.

Why might that be?

Thanks,
Rich

 

[Bob Monsen]

Rich Grise wrote:

On Thu, 04 Aug 2005 13:11:28 +0000, Genome wrote:


http://www.planarity.net/

It's got updated, perhaps due to interested people having a play with it.
You also get a PayPal link to donate a bit of money.

Now, I don't know about the underlying stuff but if I had to program one
then I would generate a n by m matrix and make random connections with
neighbours then I would randomly smear them about in a thing and then I just
have to think about equations for lines having same solutions.

Obviously my head would explode before I managed to code it.



With Konqueror, Epiphany, Galeon, and Mozilla, the majority of the
diagram is outside the box. I can only get to 1 1/2 blue dots.

Why might that be?

The drugs are kicking in?

(It's a flash program, maybe you are having a flashback...)

I'm using firefox with the linux flash thingy from macromedia, and it
works well for me.

--
Regards,
Bob Monsen

If a little knowledge is dangerous, where is the man who has
so much as to be out of danger?
Thomas Henry Huxley, 1877