90 if (dist1 * dist2 > 0)
93 float lambda = dist2 / (dist2 - dist1);
97 intersection.x = (point1.x - point2.x) * lambda + point2.x;
98 intersection.y = (point1.y - point2.y) * lambda + point2.y;
99 intersection.z = (point1.z - point2.z) * lambda + point2.z;
103 point2 = intersection;
105 point1 = intersection;
116 clipped_polygon.clear ();
117 clipped_polygon.reserve (polygon.size ());
120 if (polygon.size () < 3)
122 if (polygon.size () == 1)
126 clipped_polygon.push_back (polygon [0]);
128 else if (polygon.size () == 2)
130 clipped_polygon.push_back (polygon [0]);
131 clipped_polygon.push_back (polygon [1]);
133 clipped_polygon.clear ();
138 float previous_distance =
getDistance (polygon [0]);
140 if (previous_distance > 0)
141 clipped_polygon.push_back (polygon [0]);
143 typename std::vector<PointT, Eigen::aligned_allocator<PointT> >::const_iterator prev_it = polygon.begin ();
145 for (
typename std::vector<PointT, Eigen::aligned_allocator<PointT> >::const_iterator pIt = prev_it + 1; pIt != polygon.end (); prev_it = pIt++)
149 if (distance * previous_distance < 0)
151 float lambda = distance / (distance - previous_distance);
154 intersection.x = (prev_it->x - pIt->x) * lambda + pIt->x;
155 intersection.y = (prev_it->y - pIt->y) * lambda + pIt->y;
156 intersection.z = (prev_it->z - pIt->z) * lambda + pIt->z;
158 clipped_polygon.push_back (intersection);
161 clipped_polygon.push_back (*pIt);
163 previous_distance = distance;