Triangulation of two Segments in 3D

Started by
1 comment, last by Zao 16 years, 3 months ago
I have two segments in 3D space. I want to triangulate these segments, but there is a problem because sometimes the constructed triangles cross each other. Is there an efficient method to triangulate four points in 3D.
Advertisement
How about this?

There are three possible assignments of four points to two line-segments. In each case, compute the dot-product of the two normalised edge vectors. I assert that the assignment pertaining to the largest product, in magnitude, will not produce a complex quadrilateral [citation needed].
Ring3 Circus - Diary of a programmer, journal of a hacker.
Find the convex hull of the four points and pick the "best" of the two possible triangulations.

To make it is hell. To fail is divine.

This topic is closed to new replies.

Advertisement