| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 93 | Frank Bartling, Klaus H. Hinrichs |
A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects.  |
STACS  |
1992 |
DBLP DOI BibTeX RDF |
plane-sweep algorithm, closest-pair problem, computational geometry |
| 91 | Jing Shan, Donghui Zhang, Betty Salzberg |
On Spatial-Range Closest-Pair Query. |
SSTD |
2003 |
DBLP DOI BibTeX RDF |
|
| 78 | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir |
Kinetic and dynamic data structures for closest pair and all nearest neighbors. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
computational geometry, nearest neighbors, Kinetic data structures, closest pair |
| 78 | Minghui Jiang 0001, Joel Gillespie |
Engineering the Divide-and-Conquer Closest Pair Algorithm. |
J. Comput. Sci. Technol. |
2007 |
DBLP DOI BibTeX RDF |
circle packing, computational geometry, analysis of algorithms, algorithmic engineering, closest pair |
| 78 | Yuh-Rau Wang, Shi-Jinn Horng, Chin-Hsiung Wu |
Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System. |
IEEE Trans. Parallel Distributed Syst. |
2005 |
DBLP DOI BibTeX RDF |
LARPBS, reconfigurable bus model, Parallel algorithm, closest pair, all nearest neighbors |
| 69 | Apostolos N. Papadopoulos, Alexandros Nanopoulos, Yannis Manolopoulos |
Closest Pair Queries with Spatial Constraints. |
Panhellenic Conference on Informatics |
2005 |
DBLP DOI BibTeX RDF |
|
| 69 | Sergei Bespamyatnikh |
An Optimal Algorithm for Closest-Pair Maintenance. |
Discret. Comput. Geom. |
1998 |
DBLP DOI BibTeX RDF |
|
| 67 | Qi Ge, Haitao Wang 0001, Hong Zhu 0004 |
An Improved Algorithm for Finding the Closest Pair of Points. |
J. Comput. Sci. Technol. |
2006 |
DBLP DOI BibTeX RDF |
Shamos and Hoey algorithm, closest pair of points, complexity, divide and conquer |
| 58 | Manli Zhu, Dik Lun Lee, Jun Zhang |
k-Closest Pair Query Monitoring Over Moving Objects. |
MDM |
2006 |
DBLP DOI BibTeX RDF |
|
| 50 | Shaojie Qiao, Changjie Tang, Jing Peng, Hongjun Li, Shengqiao Ni |
Efficient k-Closest-Pair Range-Queries in Spatial Databases. |
WAIM |
2008 |
DBLP DOI BibTeX RDF |
|
| 47 | Christian Schwarz 0002, Michiel H. M. Smid |
An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. |
SODA |
1992 |
DBLP BibTeX RDF |
|
| 43 | Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos |
Closest Pair Queries in Spatial Databases. |
SIGMOD Conference |
2000 |
DBLP DOI BibTeX RDF |
|
| 42 | Quoc-Nam Tran |
An Efficient Clustering Algorithm Using Graphical Techniques. |
ITCC (1) |
2005 |
DBLP DOI BibTeX RDF |
Closest Pair Searching, Data Mining, Cluster Analysis, B-Splines, Range Searching |
| 42 | Chih-Fang Wang, Sartaj Sahni |
Computational Geometry On The OTIS-Mesh Optoelectronic Computer. |
ICPP |
2002 |
DBLP DOI BibTeX RDF |
optoelectronic computer, smallest enclosing box, ECDF, two-set dominance, maximal points, prefix sum with condition, convex hull, OTIS-Mesh, closest-pair, all-nearest neighbor |
| 40 | Jae Kyu Lee, Young J. Kim |
Haptic Rendering of Point Set Surfaces. |
WHC |
2007 |
DBLP DOI BibTeX RDF |
|
| 37 | Adrian Dumitrescu, Sumanta Guha |
Extreme Distances in Multicolored Point Sets. |
International Conference on Computational Science (3) |
2002 |
DBLP DOI BibTeX RDF |
|
| 36 | Leong Hou U, Nikos Mamoulis, Man Lung Yiu |
Computation and Monitoring of Exclusive Closest Pairs. |
IEEE Trans. Knowl. Data Eng. |
2008 |
DBLP DOI BibTeX RDF |
|
| 36 | Leong Hou U, Nikos Mamoulis, Man Lung Yiu |
Continuous Monitoring of Exclusive Closest Pairs. |
SSTD |
2007 |
DBLP DOI BibTeX RDF |
|
| 36 | |
k-Closest Pair Query. |
Encyclopedia of Database Systems |
2009 |
DBLP DOI BibTeX RDF |
|
| 36 | |
k-Closest Pair Join. |
Encyclopedia of Database Systems |
2009 |
DBLP DOI BibTeX RDF |
|
| 36 | Kerui Min, Ming-Yang Kao, Hong Zhu 0004 |
The Closest Pair Problem under the Hamming Metric. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 36 | Elke Achtert, Christian Böhm 0001, Peer Kröger |
DeLi-Clu: Boosting Robustness, Completeness, Usability, and Efficiency of Hierarchical Clustering by a Closest Pair Ranking. |
PAKDD |
2006 |
DBLP DOI BibTeX RDF |
|
| 36 | Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat |
Closest Pair Problems in Very High Dimensions. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 36 | Christian Schwarz 0002, Michiel H. M. Smid, Jack Snoeyink |
An Optimal Algorithm for the On-Line Closest-Pair Problem. |
SCG |
1992 |
DBLP DOI BibTeX RDF |
|
| 35 | Roee David, Karthik C. S., Bundit Laekhanukit |
On the Complexity of Closest Pair via Polar-Pair of Point-Sets. |
SIAM J. Discret. Math. |
2019 |
DBLP DOI BibTeX RDF |
|
| 35 | Roee David, Karthik C. S., Bundit Laekhanukit |
On the Complexity of Closest Pair via Polar-Pair of Point-Sets. |
SoCG |
2018 |
DBLP DOI BibTeX RDF |
|
| 33 | Mordecai J. Golin |
Dynamic Closest Pairs - A Probabilistic Approach. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
| 31 | Pankaj K. Agarwal, David Eppstein, Jirí Matousek 0001 |
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
Euclidean minimum spanning tree, half-space range reporting, minima, decomposable function, closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, minimum spanning trees, diameter, dynamic data structures, geometric optimization, geometric problems |
| 31 | David P. Dobkin, Subhash Suri |
Dynamically Computing the Maxima of Decomposable Functions, with Applications |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
smallest area, maximum value updating algorithm, decomposable functions, set of points, minimum separation, smallest distance, computational geometry, dynamic algorithms, hyperplanes, rectangles, closest pair |
| 29 | Congjun Yang, King-Ip (David) Lin |
An index structure for improving closest pairs and related join queries in spatial databases. |
IDEAS |
2002 |
DBLP DOI BibTeX RDF |
|
| 29 | Kenneth L. Clarkson |
An Algorithm for Approximate Closest-Point Queries. |
SCG |
1994 |
DBLP DOI BibTeX RDF |
|
| 27 | Jie Gao 0001, Li Zhang 0001 |
Well-separated pair decomposition for the unit-disk graph metric and its applications. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
well separated pair decomposition, approximation algorithm, unit-disk graph |
| 26 | Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid |
On the Power of the Semi-Separated Pair Decomposition. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 26 | Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Well-Separated Pair Decomposition and Its Applications. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
|
| 25 | Shaojie Qiao, Changjie Tang, Huidong Jin 0001, Shucheng Dai, Xingshu Chen |
Constrained k-closest pairs query processing based on growing window in crime databases. |
ISI |
2008 |
DBLP DOI BibTeX RDF |
|
| 25 | Shilpee Prasad, B. R. Purushothama |
Secure and verifiable outsourcing of Euclidean distance and closest pair of points with single untrusted cloud server. |
Int. J. Internet Protoc. Technol. |
2023 |
DBLP DOI BibTeX RDF |
|
| 25 | Václav Skala, Alejandro Esteban Martinez, David Esteban Martinez, Fabio Hernandez Moreno |
A New Algorithm for the Closest Pair of Points for Very Large Data Sets Using Exponent Bucketing and Windowing. |
ICCS (2) |
2023 |
DBLP DOI BibTeX RDF |
|
| 25 | Abrar Kazi, Michiel Smid |
Closest-pair queries and minimum-weight queries are equivalent for squares. |
Comput. Geom. |
2022 |
DBLP DOI BibTeX RDF |
|
| 25 | Timothy M. Chan, Zahed Rahmati |
Corrigendum to "Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points" [Comput. Geom. 60 (2017) 2-7]. |
Comput. Geom. |
2022 |
DBLP DOI BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013, Saladi Rahul, Ravi Janardan |
New Bounds for Range Closest-Pair Problems. |
Discret. Comput. Geom. |
2022 |
DBLP DOI BibTeX RDF |
|
| 25 | Bolong Zheng, Xi Zhao 0006, Lianggui Weng, Quoc Viet Hung Nguyen, Hang Liu 0001, Christian S. Jensen |
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search. |
VLDB J. |
2022 |
DBLP DOI BibTeX RDF |
|
| 25 | Amir Mesrikhani, Mohammad Farshi, Behnam Iranfar |
A progressive algorithm for the closest pair problem. |
Int. J. Comput. Math. Comput. Syst. Theory |
2021 |
DBLP DOI BibTeX RDF |
|
| 25 | Bolong Zheng, Xi Zhao 0006, Lianggui Weng, Nguyen Quoc Viet Hung, Hang Liu 0001, Christian S. Jensen |
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 25 | Yiqiu Wang, Shangdi Yu, Yan Gu 0001, Julian Shun |
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. |
SoCG |
2021 |
DBLP DOI BibTeX RDF |
|
| 25 | Fangwei Wu, Xike Xie, Jieming Shi |
Top-k Closest Pair Queries over Spatial Knowledge Graph. |
DASFAA (1) |
2021 |
DBLP DOI BibTeX RDF |
|
| 25 | Timothy M. Chan, Saladi Rahul, Jie Xue 0003 |
Range closest-pair search in higher dimensions. |
Comput. Geom. |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013, Ravi Janardan |
Approximate range closest-pair queries. |
Comput. Geom. |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Karthik C. S., Pasin Manurangsi |
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. |
Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Yiqiu Wang, Shangdi Yu, Yan Gu 0001, Julian Shun |
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 25 | Abrar Kazi, Michiel Smid |
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 25 | Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid |
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 25 | Ovidiu Daescu, Ka Yaw Teo |
Two-dimensional closest pair problem: A closer look. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Martin Rau, Tobias Nipkow |
Closest Pair of Points Algorithms. |
Arch. Formal Proofs |
2020 |
DBLP BibTeX RDF |
|
| 25 | Michiel Smid, Anil Maheshwari, Wolfgang Mulzer |
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics. |
J. Comput. Geom. |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013, Saladi Rahul, Ravi Janardan |
Searching for the closest-pair in a query translate. |
J. Comput. Geom. |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Timothy M. Chan |
Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique. |
SOSA |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Martin Rau, Tobias Nipkow |
Verification of Closest Pair of Points Algorithms. |
IJCAR (2) |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Abrar Kazi, Michiel Smid |
Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares. |
CCCG |
2020 |
DBLP BibTeX RDF |
|
| 25 | Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, Ruizhe Zhang 0001 |
On the Quantum Complexity of Closest Pair and Related Problems. |
CCC |
2020 |
DBLP DOI BibTeX RDF |
|
| 25 | Sang Won Bae, Michiel H. M. Smid |
Closest-pair queries in fat rectangles. |
Comput. Geom. |
2019 |
DBLP DOI BibTeX RDF |
|
| 25 | Ning Xie 0002, Shuai Xu, Yekun Xu |
A new coding-based algorithm for finding closest pair of vectors. |
Theor. Comput. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
| 25 | Timothy M. Chan, Saladi Rahul, Jie Xue 0003 |
Range closest-pair search in higher dimensions. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 25 | Rasmus Pagh, Nina Stausholm, Mikkel Thorup |
Hardness of Bichromatic Closest Pair with Jaccard Similarity. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 25 | Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, Ruizhe Zhang 0001 |
On the Quantum Complexity of Closest Pair and Related Problems. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 25 | Jie Xue 0003 |
Colored range closest-pair problem under general distance functions. |
SODA |
2019 |
DBLP DOI BibTeX RDF |
|
| 25 | Karthik C. S., Pasin Manurangsi |
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. |
ITCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 25 | Rasmus Pagh, Nina Mesing Stausholm, Mikkel Thorup |
Hardness of Bichromatic Closest Pair with Jaccard Similarity. |
ESA |
2019 |
DBLP DOI BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013, Saladi Rahul, Ravi Janardan |
Searching for the Closest-Pair in a Query Translate. |
SoCG |
2019 |
DBLP DOI BibTeX RDF |
|
| 25 | Timothy M. Chan, Saladi Rahul, Jie Xue 0003 |
Range Closest-Pair Search in Higher Dimensions. |
WADS |
2019 |
DBLP DOI BibTeX RDF |
|
| 25 | Antonio Corral, Michael Vassilakopoulos |
Closest-Pair Query. |
Encyclopedia of Database Systems (2nd ed.) |
2018 |
DBLP DOI BibTeX RDF |
|
| 25 | Zahed Rahmati, Timothy M. Chan |
A Clustering-Based Approach to Kinetic Closest Pair. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
| 25 | Karthik C. S., Pasin Manurangsi |
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. |
Electron. Colloquium Comput. Complex. |
2018 |
DBLP BibTeX RDF |
|
| 25 | Sang Won Bae, Michiel H. M. Smid |
Closest-Pair Queries in Fat Rectangles. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013, Saladi Rahul, Ravi Janardan |
Searching for the closest-pair in a query translate. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 25 | Jie Xue 0003 |
Colored range closest-pair problem under general distance functions. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 25 | Karthik C. S., Pasin Manurangsi |
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 25 | Ning Xie 0002, Shuai Xu, Yekun Xu |
A New Algorithm for Finding Closest Pair of Vectors. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 25 | Xingyu Cai, Shanglin Zhou, Sanguthevar Rajasekaran |
JUMP: A Fast Deterministic Algorithm to Find the Closest Pair of Subsequences. |
SDM |
2018 |
DBLP DOI BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013, Saladi Rahul, Ravi Janardan |
New Bounds for Range Closest-Pair Problems. |
SoCG |
2018 |
DBLP DOI BibTeX RDF |
|
| 25 | Ning Xie 0002, Shuai Xu, Yekun Xu |
A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract). |
CSR |
2018 |
DBLP DOI BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013, Ravi Janardan |
Approximate Range Closest-Pair Search. |
CCCG |
2018 |
DBLP BibTeX RDF |
|
| 25 | Xingyu Cai, Sanguthevar Rajasekaran, Fan Zhang 0010 |
Efficient Approximate Algorithms for the Closest Pair Problem in High Dimensional Spaces. |
PAKDD (3) |
2018 |
DBLP DOI BibTeX RDF |
|
| 25 | Görkem Tokatli |
En yakın çift ve en yakın komşu problemlerine sıralama bazlı yeni bir yaklaşım üzerine bir çalışma (A study on a new order based approach for the closest pair and nearest neighbor problems) |
|
2018 |
RDF |
|
| 25 | Timothy M. Chan, Zahed Rahmati |
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points. |
Comput. Geom. |
2017 |
DBLP DOI BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013, Saladi Rahul, Ravi Janardan |
New bounds for range closest-pair problems. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 25 | Omer Gold, Micha Sharir |
Dominance Product and High-Dimensional Closest Pair under L_infty. |
ISAAC |
2017 |
DBLP DOI BibTeX RDF |
|
| 25 | Sanguthevar Rajasekaran, Subrata Saha, Xingyu Cai |
Novel Exact and Approximate Algorithms for the Closest Pair Problem. |
ICDM |
2017 |
DBLP DOI BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013 |
Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces. |
WADS |
2017 |
DBLP DOI BibTeX RDF |
|
| 25 | Ovidiu Daescu, Ka Yaw Teo |
2D Closest Pair Problem: A Closer Look. |
CCCG |
2017 |
DBLP BibTeX RDF |
|
| 25 | Omer Gold, Micha Sharir |
Dominance Products and Faster Algorithms for High-Dimensional Closest Pair under L∞. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
| 25 | Jie Xue 0003, Yuan Li 0013 |
Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
| 25 | Chandrasekhar Kuruba, Kethzi Gilbert, Prabhav Sidhaye, Gaurav Pareek, Byrapura Rangappa Purushothama |
Outsource-Secured Calculation of Closest Pair of Points. |
SSCC |
2016 |
DBLP DOI BibTeX RDF |
|
| 25 | Timothy M. Chan, Zahed Rahmati |
A Clustering-Based Approach to Kinetic Closest Pair. |
SWAT |
2016 |
DBLP DOI BibTeX RDF |
|
| 25 | Francisco García-García 0001, Antonio Corral, Luis Iribarne, Michael Vassilakopoulos, Yannis Manolopoulos |
Enhancing SpatialHadoop with Closest Pair Queries. |
ADBIS |
2016 |
DBLP DOI BibTeX RDF |
|
| 25 | Gregory Valiant |
Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem. |
J. ACM |
2015 |
DBLP DOI BibTeX RDF |
|
| 25 | Yunjun Gao, Lu Chen 0001, Xinhan Li, Bin Yao 0002, Gang Chen 0001 |
Efficient k-closest pair queries in general metric spaces. |
VLDB J. |
2015 |
DBLP DOI BibTeX RDF |
|
| 25 | Timothy M. Chan, Zahed Rahmati |
Approximating the Minimum Closest Pair Distance and Nearest Neighbor Distances of Linearly Moving Points. |
CCCG |
2015 |
DBLP BibTeX RDF |
|
| 25 | Timothy M. Chan, Simon Pratt |
Time-Windowed Closest Pair. |
CCCG |
2015 |
DBLP BibTeX RDF |
|
| 25 | Ananda Swarup Das, Prosenjit Gupta, Kishore Kothapalli, Kannan Srinathan |
On reporting the L1 metric closest pair in a query rectangle. |
Inf. Process. Lett. |
2014 |
DBLP DOI BibTeX RDF |
|
| 25 | Pegah Kamousi, Timothy M. Chan, Subhash Suri |
Closest pair and the post office problem for stochastic points. |
Comput. Geom. |
2014 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license