RhPoints (Rhino.Scripting.Fsharp) | Rhino.Scripting.Fsharp

Rhino.Scripting.Fsharp

RhPoints Module

Namespace: Rhino.Scripting.FSharp
Assembly: Rhino.Scripting.FSharp.dll

This module provides curried functions to manipulate Rhino Point3d It is NOT automatically opened.

Functions and values

Function or value	Description
`RhPoints.closestPoint pt pts` Full Usage: `RhPoints.closestPoint pt pts` Parameters: pt : `Point3d` pts : `ResizeArray<Point3d>` Returns: `Point3d`	returns the closest point from a Point list to a given Point pt : `Point3d` pts : `ResizeArray<Point3d>` Returns: `Point3d`
`RhPoints.closestPointIdx pt pts` Full Usage: `RhPoints.closestPointIdx pt pts` Parameters: pt : `Point3d` pts : `ResizeArray<Point3d>` Returns: `int`	returns the closest point index from a Point list to a given Point pt : `Point3d` pts : `ResizeArray<Point3d>` Returns: `int`
`RhPoints.closestPointsIdx xs ys` Full Usage: `RhPoints.closestPointsIdx xs ys` Parameters: xs : `ResizeArray<Point3d>` ys : `ResizeArray<Point3d>` Returns: `int * int`	returns the indices of the points that are closest to each other xs : `ResizeArray<Point3d>` ys : `ResizeArray<Point3d>` Returns: `int * int`
`RhPoints.cullDuplicatePointsInSeq tolerance pts` Full Usage: `RhPoints.cullDuplicatePointsInSeq tolerance pts` Parameters: tolerance : `float` pts : `ResizeArray<Point3d>` Returns: `ResizeArray<Point3d>`	Culls points if they are too close to previous or next item Last and first points stay the same tolerance : `float` pts : `ResizeArray<Point3d>` Returns: `ResizeArray<Point3d>`
`RhPoints.findContinuousPoints tolGap ptss` Full Usage: `RhPoints.findContinuousPoints tolGap ptss` Parameters: tolGap : `float` ptss : `ResizeArray<ResizeArray<Point3d>>` Returns: `ResizeArray<Point3d>`	Similar to Join Polylines, this tries to find continuous sequences of points. 'tolGap' is the maximum allowable gap between the start and the endpoint of two segments. Search starts from the segment with the most points. Both start and end point of each point list is checked for adjacency tolGap : `float` ptss : `ResizeArray<ResizeArray<Point3d>>` Returns: `ResizeArray<Point3d>`
`RhPoints.minDistBetweenPointSets xs ys` Full Usage: `RhPoints.minDistBetweenPointSets xs ys` Parameters: xs : `ResizeArray<Point3d>` ys : `ResizeArray<Point3d>` Returns: `float`	returns the smallest Distance between Point Sets xs : `ResizeArray<Point3d>` ys : `ResizeArray<Point3d>` Returns: `float`
`RhPoints.mostDistantPoint findPointFrom checkAgainst` Full Usage: `RhPoints.mostDistantPoint findPointFrom checkAgainst` Parameters: findPointFrom : `ResizeArray<Point3d>` checkAgainst : `ResizeArray<Point3d>` Returns: `Point3d`	find the point that has the biggest distance to any point from another set findPointFrom : `ResizeArray<Point3d>` checkAgainst : `ResizeArray<Point3d>` Returns: `Point3d`
`RhPoints.mostDistantPointIdx findPointFrom checkAgainst` Full Usage: `RhPoints.mostDistantPointIdx findPointFrom checkAgainst` Parameters: findPointFrom : `ResizeArray<Point3d>` checkAgainst : `ResizeArray<Point3d>` Returns: `int * int`	find the index of the point that has the biggest distance to any point from the other set basically the most lonely point in 'findPointFrom' list with respect to 'checkAgainst' list returns findPointFromIdx * checkAgainstIdx findPointFrom : `ResizeArray<Point3d>` checkAgainst : `ResizeArray<Point3d>` Returns: `int * int`
`RhPoints.pop i xs` Full Usage: `RhPoints.pop i xs` Parameters: i : `int` xs : `ResizeArray<'T>` Returns: `'T`	i : `int` xs : `ResizeArray<'T>` Returns: `'T`