R. Clayton (rclayton@monmouth.edu)
(no date)
In the input parameter of function triangulation, my understanding is g and y
will have co-ordinates for green and yellow triangles, for which the points
in c ptvec will be checked for being in/out of green and yellow triangle,
thus finding greenish, yellowish and clear points. Am I correct?
Almost. There's no requirements that either g or y contain enough points to
form a triangle.
Can we assume first 3 points in g forms one green triangle, next 3 points
form another green triangle, and so on?
You can't; any three non-collinear points from g form a valid triangle.
I saw that g and y ptvec do not always have points which are multiple of 3.
How do I determine the vertices of green and yellow triangles?
I'm not understanding this question. Can you give me an example that
demonstrates the situation related to this question?
Every valid triangle has three non-collinear vertices. Do we assume that the
input will have valid triangle, or we have to check non-collinerity condition
for vertices of each triangle?
You probably want to review the first answer given in the the message with the
subject "Assignment 3 questions", which can be found in your mailbox
(possibly), in the hypermail archive, or in the class news group.
This archive was generated by hypermail 2.0b3 on Fri May 09 2003 - 15:30:05 EDT