private queryVisibility ( Vector2 q1, Vector2 q2, float radius ) : bool | ||
q1 | Vector2 | The first point between which visibility is to be * tested. |
q2 | Vector2 | The second point between which visibility is to be * tested. |
radius | float | The radius within which visibility is to be * tested. |
return | bool |
/** * <summary>Performs a visibility query between the two specified points * with respect to the obstacles.</summary> * * <returns>A boolean specifying whether the two points are mutually * visible. Returns true when the obstacles have not been processed. * </returns> * * <param name="point1">The first point of the query.</param> * <param name="point2">The second point of the query.</param> * <param name="radius">The minimal distance between the line connecting * the two points and the obstacles in order for the points to be * mutually visible (optional). Must be non-negative.</param> */ public bool queryVisibility(KInt2 point1, KInt2 point2, KInt radius) { return(kdTree_.queryVisibility(point1, point2, radius)); }
/** * <summary>Performs a visibility query between the two specified points * with respect to the obstacles.</summary> * * <returns>A boolean specifying whether the two points are mutually * visible. Returns true when the obstacles have not been processed. * </returns> * * <param name="point1">The first point of the query.</param> * <param name="point2">The second point of the query.</param> * <param name="radius">The minimal distance between the line connecting * the two points and the obstacles in order for the points to be * mutually visible (optional). Must be non-negative.</param> */ internal bool queryVisibility(Vector2 point1, Vector2 point2, double radius) { return(kdTree_.queryVisibility(point1, point2, radius)); }
/** * <summary>Performs a visibility query between the two specified points * with respect to the obstacles.</summary> * * <returns>A boolean specifying whether the two points are mutually * visible. Returns true when the obstacles have not been processed. * </returns> * * <param name="point1">The first point of the query.</param> * <param name="point2">The second point of the query.</param> * <param name="radius">The minimal distance between the line connecting * the two points and the obstacles in order for the points to be * mutually visible (optional). Must be non-negative.</param> */ public bool queryVisibility(Vector2 point1, Vector2 point2, float radius) { return(kdTree_.queryVisibility(point1, point2, radius)); }
/** * <summary>Performs a visibility query between the two specified points * with respect to the obstacles.</summary> * * <returns>A boolean specifying whether the two points are mutually * visible. Returns true when the obstacles have not been processed. * </returns> * * <param name="point1">The first point of the query.</param> * <param name="point2">The second point of the query.</param> * <param name="radius">The minimal distance between the line connecting * the two points and the obstacles in order for the points to be * mutually visible (optional). Must be non-negative.</param> */ public bool queryVisibility(Vec2 point1, Vec2 point2, Fix64 radius) { return(kdTree_.queryVisibility(point1, point2, radius)); }