The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Relative neighborhood graphs and their relatives
Abstract
Results of neighborhood graphs are surveyed. Properties, bounds on the size, algorithms, and variants of the neighborhood graphs are discussed. Numerous applications including computational morphology, spatial analysis, pattern classification, and databases for computer vision are described.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Image analysis and mathematical morphology
(1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90078-8 · Cited by 8,151
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
Image Analysis and Mathematical Morphology.
Diggle, P. J., & Serra, J. (1983) · Biometrics · doi:10.2307/2531038 · Cited by 3,894
Random Sets and Integral Geometry.
Ripley, B. D., & Matheron, G. (1976) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2345196 · Cited by 3,085
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Algorithms in Combinatorial Geometry.
Goodman, J. E., & Edelsbrunner, H. (1989) · The American Mathematical Monthly · doi:10.2307/2325168 · Cited by 1,788
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
Cited by
Dray, S., Legendre, P., & Peres-Neto, P. R. (2006) · Ecological Modelling · doi:10.1016/j.ecolmodel.2006.02.015 · Cited by 2,003
Classification in the Presence of Label Noise: A Survey
Frenay, B., & Verleysen, M. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2292894 · Cited by 1,777
Large-Scale Point Cloud Semantic Segmentation with Superpoint Graphs
Landrieu, L., & Simonovsky, M. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00479 · Cited by 1,543
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
Cortes, J., Martinez, S., & Bullo, F. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.878713 · Cited by 695
A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data
Song, Q., Ni, J., & Wang, G. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.181 · Cited by 663
Motion Coordination with Distributed Information
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.384124 · Cited by 526
Coverage in wireless ad hoc sensor networks
Li, X.-Y., Wan, P.-J., & Frieder, O. (2003) · IEEE Transactions on Computers · doi:10.1109/tc.2003.1204831 · Cited by 521
Automatic rigging and animation of 3D characters
Baran, I., & Popović, J. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276467 · Cited by 495
Spatially-distributed coverage optimization and control with limited-range interactions
Cortés, J., Martínez, S., & Bullo, F. (2005) · ESAIM: Control, Optimisation and Calculus of Variations · doi:10.1051/cocv:2005024 · Cited by 461
Automatic rigging and animation of 3D characters
Baran, I., & Popović, J. (2007) · ACM Transactions on Graphics · doi:10.1145/1276377.1276467 · Cited by 455
Fast approximate nearest neighbor search with the navigating spreading-out graph
Fu, C., Xiang, C., Wang, C., & Cai, D. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3303753.3303754 · Cited by 379
Wang, M., Xu, X., Yue, Q., & Wang, Y. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3476249.3476255 · Cited by 264
Metadata
- Authors
- Jaromczyk, J. W., & Toussaint, G. T.
- Venue
- Proceedings of the IEEE
- Published
- 1992
- Volume
- 80
- Issue
- 9
- Pages
- 1502-1517
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2163227453
- Cited by
- 664
- References
- 34
- FWCI
- 6.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.