nearestNeighbor — Find nearest DelaunayTri vertices for query points.
nearestNeighbor(dt, q) returns one-based indices of the nearest triangulation vertices for an N-by-2 query matrix. nearestNeighbor(dt, x, y) accepts coordinate vectors.
Syntax
nearestNeighbor(dt, q)How nearestNeighbor works
- Accepts query matrices or paired coordinate vectors.
- Returns an N-by-1 tensor of one-based vertex indices.
- Returns NaN for queries against an empty point set.
Example
Find nearest vertices
dt = DelaunayTri([0 0; 1 0; 0 1]);
idx = nearestNeighbor(dt, [0.2 0.1; 0.8 0.1]);Using nearestNeighbor with coding agents
Open a RunMat example with live inputs, then ask the agent to explain how nearestNeighbor changes the result.
Run a small nearestNeighbor example, explain the result, then change one input and compare the output.
Related Geometry functions
Open-source implementation
Unlike proprietary runtimes, every RunMat function is open-source. Read exactly how nearestNeighbor is executed, line by line, in Rust.
- View the source for 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 an open-source runtime that executes MATLAB-syntax code blazing on any GPU. It is licensed under the Apache 2.0 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.