Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Maintaining the minimal distance of a point set in polylogarithmic time
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Separator based parallel divide and conquer in computational geometry
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for the on-line closest-pair problem
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A deterministic linear time algorithm for geometric separators and its applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
New techniques for exact and approximate dynamic closest-point problems
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the eleventh annual symposium on Computational geometry
Nearest neighbor queries in metric spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A unifying data structure for hierarchical methods
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
The analysis of a simple k-means clustering algorithm
Proceedings of the sixteenth annual symposium on Computational geometry
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
IEEE Transactions on Visualization and Computer Graphics
Efficient Expected-Case Algorithms for Planar Point Location
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Computing Farthest Neighbors on a Convex Polytope
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Dynamic Compressed Hypertoctrees with Application to the N-Body Problem
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Computing farthest neighbors on a convex polytope
Theoretical Computer Science - Computing and combinatorics
GraphZip: a fast and automatic compression method for spatial data clustering
Proceedings of the 2004 ACM symposium on Applied computing
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Distance join queries on spatial networks
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Computational Geometry: Theory and Applications
A fast all nearest neighbor algorithm for applications involving large point-clouds
Computers and Graphics
Region-fault tolerant geometric spanners
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms (TALG)
Efficient approximation algorithms for clustering point-sets
Computational Geometry: Theory and Applications
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Journal of Discrete Algorithms
Attributed relational graph matching based on the nested assignment structure
Pattern Recognition
Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection
The Journal of Machine Learning Research
Push-Pull marginal discriminant analysis for feature extraction
Pattern Recognition Letters
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Gene selection and classification using Taguchi chaotic binary particle swarm optimization
Expert Systems with Applications: An International Journal
An Energy-Efficient Resource Allocation Scheme for Mobile Ad Hoc Computational Grids
Journal of Grid Computing
A fast and effective method for pruning of non-dominated solutions in many-objective problems
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Studies on neighbourhood graphs for communication in multi agent systems
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Practical construction of k-nearest neighbor graphs in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Farthest-Point queries with geometric and combinatorial constraints
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
PatZip: pattern-preserved spatial data compression
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Minimizing interference in ad-hoc networks with bounded communication radius
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Fast approximate nearest-neighbor search with k-nearest neighbor graph
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Minimizing interference in ad hoc networks with bounded communication radius
Information Processing Letters
A Deterministic Linear Time Algorithm For Geometric Separators And Its Applications
Fundamenta Informaticae
A fast k-neighborhood algorithm for large point-clouds
SPBG'06 Proceedings of the 3rd Eurographics / IEEE VGTC conference on Point-Based Graphics
Parallel construction of k-nearest neighbor graphs for point clouds
SPBG'08 Proceedings of the Fifth Eurographics / IEEE VGTC conference on Point-Based Graphics
Kinetic data structures for all nearest neighbors and closest pair in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |