Pages that link to "Item:Q3883531"
From MaRDI portal
The following pages link to Optimal Expected-Time Algorithms for Closest Point Problems (Q3883531):
Displayed 50 items.
- On the geometry of similarity search: dimensionality curse and concentration of measure (Q294719) (← links)
- A new point symmetry based fuzzy genetic clustering technique for automatic evolution of clusters (Q730922) (← links)
- On search by address computation (Q802312) (← links)
- Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Finding nearest neighbors with Voronoi tessellations (Q910225) (← links)
- Probably correct \(k\)-nearest neighbor search in high dimensions (Q962679) (← links)
- GAPS: A clustering method using a new point symmetry-based distance measure (Q996422) (← links)
- Monitoring correlative financial data streams by local pattern similarity (Q1045646) (← links)
- Defect location clustering schemes (Q1056169) (← links)
- Computing relative neighbourhood graphs in the plane (Q1082094) (← links)
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374) (← links)
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
- A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
- Some problems in computational geometry (Q1101225) (← links)
- A linear expected-time algorithm for computing planar relative neighbourhood graphs (Q1108002) (← links)
- An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187) (← links)
- A note on linear expected time algorithms for finding convex hulls (Q1142045) (← links)
- Order preserving extendible hashing and bucket tries (Q1157906) (← links)
- The extendible cell method for closest point problems (Q1161290) (← links)
- Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- Approximate closest-point queries in high dimensions (Q1209329) (← links)
- Chromatic nearest neighbor searching: A query sensitive approach (Q1595399) (← links)
- Enhancing point symmetry-based distance for data clustering (Q1797744) (← links)
- An algorithm for geometric minimum spanning trees requiring nearly linear expected time (Q1824386) (← links)
- Analysis of N-trees (Q1836985) (← links)
- Expected-time complexity results for hierarchic clustering algorithms which use cluster centres (Q1838036) (← links)
- On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes (Q1873689) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- The expected size of the sphere-of-influence graph (Q1903638) (← links)
- Accounting for boundary effects in nearest-neighbor searching (Q1923772) (← links)
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem (Q1928502) (← links)
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions (Q2459569) (← links)
- A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
- Clustering, classification and image segmentation on the grid (Q2563647) (← links)
- A symmetry based multiobjective clustering technique for automatic evolution of clusters (Q2654238) (← links)
- Approximate model predictive control laws for constrained nonlinear discrete-time systems: analysis and offline design (Q2871761) (← links)
- Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows (Q2997961) (← links)
- Stochastic Methods for Global Optimization (Q3220103) (← links)
- Stochastic global optimization methods part II: Multi level methods (Q3773709) (← links)
- systolic array exploitation of a neural network inherent parallelism solving the nearest neighbor problem (Q4375959) (← links)
- Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering (Q4513203) (← links)
- Approximate model predictive control laws for constrained nonlinear discrete-time systems: analysis and offline design (Q5022817) (← links)
- Neighbours on a grid (Q5054822) (← links)
- Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
- Transport clustering and routing as a visual meshing process (Q5455292) (← links)
- An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells (Q6112685) (← links)
- Greedy triangulation can be efficiently implemented in the average case (Q6118596) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)