Optimal Expected-Time Algorithms for Closest Point Problems
From MaRDI portal
Publication:3883531
Cited in
(51)- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- Probably correct \(k\)-nearest neighbor search in high dimensions
- Dynamic closest pairs — A probabilistic approach
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
- An algorithm for geometric minimum spanning trees requiring nearly linear expected time
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Transport clustering and routing as a visual meshing process
- Chromatic nearest neighbor searching: A query sensitive approach
- Monitoring correlative financial data streams by local pattern similarity
- Expected-time complexity results for hierarchic clustering algorithms which use cluster centres
- On the geometry of similarity search: dimensionality curse and concentration of measure
- Higher-dimensional Voronoi diagrams in linear expected time
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- The expected size of the sphere-of-influence graph
- On the stabbing number of a random Delaunay triangulation
- A sweepline algorithm for Voronoi diagrams
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- A note on linear expected time algorithms for finding convex hulls
- Fast linear expected-time algorithms for computing maxima and convex hulls
- Stochastic global optimization methods part II: Multi level methods
- Clustering, classification and image segmentation on the grid
- Approximate model predictive control laws for constrained nonlinear discrete-time systems: analysis and offline design
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Approximate closest-point queries in high dimensions
- Stochastic Methods for Global Optimization
- Accounting for boundary effects in nearest-neighbor searching
- A comparison of sequential Delaunay triangulation algorithms.
- Expected time analysis for Delaunay point location
- Computing relative neighbourhood graphs in the plane
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
- A linear expected-time algorithm for computing planar relative neighbourhood graphs
- Enhancing point symmetry-based distance for data clustering
- On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
- Finding nearest neighbors with Voronoi tessellations
- GAPS: A clustering method using a new point symmetry-based distance measure
- A new point symmetry based fuzzy genetic clustering technique for automatic evolution of clusters
- Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows
- Defect location clustering schemes
- systolic array exploitation of a neural network inherent parallelism solving the nearest neighbor problem
- Neighbours on a grid
- \textsc{TriMe++}: multi-threaded triangular meshing in two dimensions
- On search by address computation
- An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells
- Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering
- Analysis of N-trees
- Some problems in computational geometry
- Greedy triangulation can be efficiently implemented in the average case
- Order preserving extendible hashing and bucket tries
- The extendible cell method for closest point problems
- A symmetry based multiobjective clustering technique for automatic evolution of clusters
- Approximate model predictive control laws for constrained nonlinear discrete-time systems: analysis and offline design
This page was built for publication: Optimal Expected-Time Algorithms for Closest Point Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883531)
