comp.graphics.algorithms

Subject: General flat-flat intersection

---

Given is an n-flat and an m-flat. A k-flat is represented by a point and
k linearly independent tangent vectors. The intersection of a n-flat and
a m-flat is at most a min(n, m)-flat. Give an algorithm to compute the
intersection flat in the point-tangent form.

Here are some special cases in 3D:
0-flat and 2-flat: point-plane intersection
1-flat and 1-flat: ray-ray intersection
1-flat and 2-flat: ray-plane intersection
2-flat and 2-flat: plane-plane intersection
etc..

This is pure curiosity, no practical need involved.

--
Kalle Rutanen
http://kaba.hilvi.org

Reply

---

View All Messages in comp.graphics.algorithms

path:


Replies:
Re: General flat-flat intersection