On May 27, 1:22 am, Feng <[EMAIL PROTECTED]> wrote:
> Hi all!
>
> Given 3 points in 3D, what is the fast and numerically stable way to
> test if they form a triangle?
>
> I am thinking computing the determinant of the square matrix formed by
> the 3 points and testing if the determinant is nonzero. But I am not
> sure.
>
> What about the case for high dimensions, i.e. 4D, 5D ...
>
Distance matrices with elements m(i,j) = squared Euclidean distance
have (d + 1) nonzero eigenvalues, where d is the dimensionality of the
figure, points are embedded in (2 nonzero eigenvalues linear shape, 3
nonzero eigenvalues planar shape, etc.)
kunzmilan
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
