DelaunayTri.nearestNeighbor — Find nearest DelaunayTri vertices for query points.
nearestNeighbor(dt,q) locates the closest triangulation vertex for each query point; nearestNeighbor(dt,x,y) accepts paired coordinate vectors.
Syntax
vi = dt.nearestNeighbor(q)
vi = dt.nearestNeighbor(x,y)Inputs
dt- Type
Any- Required
- Yes
- Default
- —
- Description
- DelaunayTri object.
q- Type
NumericArray- Required
- Yes
- Default
- —
- Description
- Finite N-by-2 query coordinates.
x- Type
NumericArray- Required
- Yes
- Default
- —
- Description
- Query x-coordinate vector.
y- Type
NumericArray- Required
- Yes
- Default
- —
- Description
- Query y-coordinate vector of the same length.
Returns
vi- Type
NumericArray- Description
- One-based nearest-vertex indices, or NaN if there are no points.
Errors
RunMat:DelaunayTri:InvalidArgument- When
- Constructor, object, constraint, or query inputs are malformed.
- Message
DelaunayTri: invalid argument
RunMat:DelaunayTri:Unsupported- When
- A requested triangulation form is not implemented.
- Message
DelaunayTri: unsupported form
RunMat:nearestNeighbor:TooManyOutputs- When
- More than one nearest-neighbor output is requested.
- Message
nearestNeighbor: too many output arguments
Query coordinates and result
Supply an N-by-2 query matrix or equally sized x and y vectors. The result is an N-by-1 double array of one-based nearest-vertex indices; an empty point set produces NaN indices.
MATLAB-compatible object and query coordinates use double storage. Typed-integer coordinates are accepted in RunMat compatibility mode. The search is performed on the host, without a provider kernel or fusion path.
Example
Query through the object method
dt = DelaunayTri([0 0; 1 0; 0 1]);
idx = dt.nearestNeighbor([0.2 0.1; 0.8 0.1])Using DelaunayTri.nearestNeighbor with coding agents
Open a RunMat example with live inputs, then ask the agent to explain how DelaunayTri.nearestNeighbor changes the result.
Run a small DelaunayTri.nearestNeighbor example, explain the result, then change one input and compare the output.
Related Geometry functions
Triangulation
DelaunayTri · DelaunayTri.freeBoundary · DelaunayTri.pointLocation · freeBoundary · nearestNeighbor · pointLocation
Construction
geometry.box · geometry.chamfer · geometry.cylinder · geometry.edges · geometry.edgesIntroducedBy · geometry.extrude · geometry.faces · geometry.facesIntroducedBy · geometry.fillet · geometry.finish · geometry.hole · geometry.instance · geometry.intersect · geometry.pocket · geometry.revolve · geometry.solid · geometry.sphere · geometry.subtract · geometry.transform · geometry.union · geometry.withRegion
Source you can read
Every RunMat function's source is public. Read exactly how DelaunayTri.nearestNeighbor is executed, line by line, in Rust.
- View the source for DelaunayTri.nearestNeighbor in Rust on GitHub
- Learn how the RunMat runtime works
- Found a bug? Open an issue with a minimal reproduction.
About RunMat
RunMat is a runtime that executes MATLAB-syntax code fast on any GPU. The runtime is free for individuals, including freelancers; students and faculty at an academic institution, for teaching or research there; contributors to an open-source project, for work on that project; organizations with 250 or fewer people and US$10M or less in annual revenue; and anyone, for non-production use. See runmat.com/license.
- RunMat automatically optimizes your math for GPU execution on Apple, Nvidia, and AMD hardware. No code changes needed. Simulations that took hours now take minutes.
- Start running code in seconds. RunMat runs in the browser, on the desktop, or from the CLI. No license server, no IT ticket.