Re: Line-Line-Segmentation in 3-Dimensions
- From: Kaba <none@xxxxxxxx>
- Date: Fri, 24 Mar 2006 19:23:03 +0200
In article <dvu193$h0$00$1@xxxxxxxxxxxxxxxxx>, Laube@xxxxxxxxxxxx
says...
Hello Everybody.
In my Project, i have to calculate line-line-Segmentations with quite
small lines and close distances. I tried to use the 2D
Intersection-algorithmn, described in Dave Eberleys book "Geometric
Tools for Computer Graphics", but it seems to be not exact enough. Maybe
the Problem is that i rotate the Lines onto the X-Y-Plane by a
rotationMatrix, which seems not 100%precise (sometimes, the of a Point
z-Value is ~1.0E-6 after the Rotation with the Matrix).
So my Question is: is there a algorithm to Calculate the Cutpoint of two
Lines in 3D (if it exists) without working in 2D?
Like others have said, the problem is such that it nearly never happens.
In these situations it is usual to cast the problem into another similar
problem where one can use an epsilon value to control accuracy. For
example, to tell if two lines intersect, we could compute their distance
and state that if the distance is less than 0.001, then we consider the
lines intersecting.
To cast your problem into this kind of another problem you have to
define what the "cutpoint" means if the lines do not actually intersect.
This is in analog to my definition of intersection above.
--
Kalle Rutanen
http://kaba.hilvi.org
.
- Follow-Ups:
- Re: Line-Line-Segmentation in 3-Dimensions
- From: Kaba
- Re: Line-Line-Segmentation in 3-Dimensions
- References:
- Line-Line-Segmentation in 3-Dimensions
- From: Peter Laube
- Line-Line-Segmentation in 3-Dimensions
- Prev by Date: Re: Line-Line-Segmentation in 3-Dimensions
- Next by Date: Re: having trouble with Discrete Cosine Transform program
- Previous by thread: Re: Line-Line-Segmentation in 3-Dimensions
- Next by thread: Re: Line-Line-Segmentation in 3-Dimensions
- Index(es):
Relevant Pages
|
