MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive

WTD: point intersection in space


I've looked carefully at Wickham-Jone's "Mathematica Graphics",
based on recommendations from old newsgroup postings, and it is
a good resource.  But I'm looking for a method that he doesn't
seem to include.

For all this I can ensure that a unique solution does exist,
but would like to handle tiny errors as are neatly handled by
Wickham-Jones with his methods.

In n-dimensional euclidian space n (n-1)-dimensional objects
intersect at a unique point.  For example, in 2-space 2 1-d
lines intersect in a point, in 3-space 3 2-d planes intersect
in a point.

I'm trying to find the general pattern that solves for this
in n-space.  At the moment I'd settle for seeing very similar
developments for 2-space and 3-space.  Maybe from that I could
guess what this would look like for n-space.

Any pointers or suggestions would be greatly appreciated.
Thank you


  • Prev by Date: RE: Min[], Max[]
  • Next by Date: Re: Tree and Lists
  • Previous by thread: RE : Problem with function
  • Next by thread: Re: WTD: point intersection in space