Remember, we're talking about a computer implementation algo.

How would you even define (store) an open sphere except by triangulating it or using an infinite amount of data if the aperture (opening) is irregular? Tough one, isn't it?

And even if you could, somehow - other than triangulating -, store your open sphere, wouldn't it make the entire exercise futile seeing as how a normal (closed) sphere is defined so much simpler: a vertex (centre position) and a radius?

But the short, simple answer is, as you might expect, "I don't know".

But I've never thougt of it from this angle... what a difference it makes to be outside the box, no?

2nd. point:

Adminy, will you take me up on my offer to coproduce a 3D engine? you good at coding?

Oh, and here's a 3D treat ;D :

Applying fish eye lens projection effect :

VertexX

ProjectedX=--------------------------------------

√(VertexX²+VertexY²+VertexZ²)

and, analogue,

VertexY

ProjectedY=--------------------------------------

√(VertexX²+VertexY²+VertexZ²)

Next time I'll paste an description of curved interpolation. Stay tuned!!!

Enjoy. I'll be launching a HomeSite (eventually - I'm such a sloth ). I'll be sure to paste a link here!

Cheers!

]]>wow now I see.. the 1st one was pretty obvious!]]>

1. If there is at least one edge that is not common to at least 2 faces (facets) of the body, then it is open. Otherwise it is closed. (Note: if there's one edge of this type there's bound to be at least another 2 )

2. The MAXIMUM NUMBER of segments that may be projected upon some arbitrary line is (S-1)*4, where S is the number of segments that may intersect themselves in any way possible and are projected into the segments on the arbitrary line.

Thanx for posting. Hope this is clear enough.

Oh, and Wink, how about a joint 3D engine project. You good at coding?

]]>Imagine a cube. 6 vertices.[V1...V6]. Closed figure .

Now imagine a point outside the cube P1. Connect P1 with V1.

We new have a closed "geometrical body" with 7 vtxs, one of them only connected to 1 other.

P1 --- V1 ---

| \

| \

There are other situations where this can ocur

]]>I also don't know what #2 is asking.

These answers aren't rigorous proofs by any means, just intuitive thoughts based on the definitions of things.

]]>Second, what wierd timing ... I have been working on modelling solids the last week!

]]>Here goes.

1. How can you tell if a geometrical body is closed or open (is there any way to get inside it without going through a face)? Only a real test will do. No intuitive answers such as "You see if there's a facet missing or not" is acceptable. A valid algorhitm is required.

Nothing is obvious in the computer world, remember this. Water might be dry for all a computer knows...

2. Given N planar line segments (line segments inside a plane) that may intersect THEMSELVES in ANY WAY, what is the MAXIMUM NUMBER of segments that may be projected upon some arbitrary line (inside the same plane)? All of the N segments stay on the same side of the line that projection occurs on.

The challenge has been set. Who shall rise to meet it? If there's no correct answer to any one of the 2 questions within a reasonable period of time I shall intervene to enlighten.

Do contact if clarifications are needed.

Cheers!

]]>