closest
Queries · api.md § closest · all operations
definition
closest(s: Solid, points: list<Point3>) -> list<Point3>
Finds the point of the solid nearest each point.
Returns, for each point in order, a point of s such that no other point of s is nearer to the given point. Here s is the solid with its inside counted in, as for distance, so a point that s holds is its own nearest point. For a point outside s, the nearest point lies on the boundary of s: on a face, an edge or a vertex. Where several points of s are equally near, as the points round a ring are from a point on a torus's axis, any one of them is a correct answer.
Example. Solid 1 is a 10 × 20 × 30 mm box with one corner at the origin. The first point is inside it.
> {"cmd": "closest", "s": 1, "points": [[5, 10, 15], [20, 10, 15]]}
< {"ok": [[5.0, 10.0, 15.0], [10.0, 10.0, 15.0]]}common to queries
| Function | Fields | Returns |
|---|---|---|
volume | s | Volume |
area | s | Area |
classify | s, points | list<"in" or "on" or "out"> |
closest | s, points | list<Point3> |
normal | s, points | list<Vector3 or null> |
curvature | s, points | list<Number[2] or null> |
check | s | list<string> |
centroid | s | Point3 or null |
inertia | s | Number[3][3] |
distance | a, b | Length |
interference | a, b | {volume: Volume, gap: Length} |
betti | s | Count[3] |
section_area | s, origin, normal | Area |
section | s, origin, normal, tolerance | list<list<Point3>> |
project | s, direction, tolerance | {visible: list<list<Point2>>, hidden: list<list<Point2>>} |
bounding_box | s | Point3[2] |
split | s, origin, normal | Solid[2] |
mesh | s, tolerance | {positions: list<Point3>, triangles: list<Index[3]>} |
display | s, tolerance | {faces: list<Face>, edges: list<list<Point3>>} |
raycast | s, origin, direction; or s, rays | list<Length>; or list<list<Length>> |