I am confused about how does the algorithm that "Partition objects into two halves by centroid" work? For example, I wonder why there is no partition between the third and fourth triangles on the left.
aravind00r
I think the point of the algorithm is to create as many candidate partitions as there are xmin and xmax (could be another axis y or z as well) for each triangle, then evaluate how much surface area will end up on either side for each candidate. There "technically" are partitions between the third and fourth triangles: The right side partition of the third triangle and the left side partition of the fourth triangle.
I am confused about how does the algorithm that "Partition objects into two halves by centroid" work? For example, I wonder why there is no partition between the third and fourth triangles on the left.
I think the point of the algorithm is to create as many candidate partitions as there are xmin and xmax (could be another axis y or z as well) for each triangle, then evaluate how much surface area will end up on either side for each candidate. There "technically" are partitions between the third and fourth triangles: The right side partition of the third triangle and the left side partition of the fourth triangle.