
Public Member Functions | |
| DLine3 (const DLine3 &ref) | |
| DLine3 & | operator= (const DLine3 &v) |
| void | Add (const DPoint2 &p) |
| void | NearestPoint2D (const DPoint2 &Point, int &iIndex, double &dist) const |
| bool | ContainsPoint2D (const DPoint2 &p) const |
| bool DLine3::ContainsPoint2D | ( | const DPoint2 & | p | ) | const |
With the assumption that this set of points defines a closed polygon, test whether the polygon contains a given point. Since a simple array of points being interpreted as a polygon, this means the data may be concave or convex, but not contains holes. The third (Z) coordinate is ignored.
| void DLine3::NearestPoint2D | ( | const DPoint2 & | Point, | |
| int & | iIndex, | |||
| double & | dClosest | |||
| ) | const |
Return the nearest (2D distance) point (of the points which make up the line). This is not the same as the closest place on the line, which may lie between the defining points.
| Point | The input point. | |
| iIndex | Index of the first point of the nearest line segment. | |
| dClosest | Distance from the DLine2 to the input point. |
1.5.7.1