Lines Matching refs:point
102 static float angle(const Vector2& point, const Vector2& center) {
103 return atan2(point.y - center.y, point.x - center.x);
114 * @param p1 The first point defining the line segment
115 * @param p2 The second point defining the line segment
121 // intersection point should stay on both the ray and the edge of (p1, p2).
178 // Remove the middle point of the three last
199 // Remove the middle point of the three last
232 * Sort points about a center point
278 * Test whether a point is inside the polygon.
280 * @param testPoint the point to test
336 * Compute a horizontal circular polygon about point (x , y , height) of radius
527 // intersect with the outline vertex's circle at point (I).
529 // Then the intersetion point can be computed as Ixy = Vxy * ratioIC + Cxy * ratioVI;
633 // Normally, loop 3 times, we can find the closest point.
658 // floating point error, when the intersection point is slightly outside the segment.
813 // If the ray hit the polygon first, then return the intersection point as the
979 // shorter distance to the centroid, b/t the umbra vertex or the intersection point.
1085 * Using Marte Carlo method, we generate a random point, and if it is inside the
1103 // Generate a random point between minX, minY and maxX, maxY.
1111 // If the random point is in both poly 1 and 2, then it must be intersection.
1115 ALOGW("(Error Type 1): one point (%f, %f) in the intersection is"
1122 ALOGW("(Error Type 1): one point (%f, %f) in the intersection is"