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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
On the shape of a set of points in the plane
Edelsbrunner, H., Kirkpatrick, D., & Seidel, R. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056714 · Cited by 1,634
Algorithms in Combinatorial Geometry
Edelsbrunner, H. (1987) · Springer eBooks · doi:10.1007/978-3-642-61568-9 · Cited by 1,534
Early processing of visual information
Marr, D. (1976) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1976.0090 · Cited by 1,034
The relative neighbourhood graph of a finite planar set
Toussaint, G. T. (1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90066-7 · Cited by 1,008
Self-citationAlgorithms for Reporting and Counting Geometric Intersections
Bentley, & Ottmann (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675432 · Cited by 996
A New Statistical Approach to Geographic Variation Analysis
Gabriel, K. R., & Sokal, R. R. (1969) · Systematic Zoology · doi:10.2307/2412323 · Cited by 854
Matula, D. W., & Sokal, R. R. (1980) · Geographical Analysis · doi:10.1111/j.1538-4632.1980.tb00031.x · Cited by 366
Optimal Expected-Time Algorithms for Closest Point Problems
Bentley, J. L., Weide, B. W., & Yao, A. C.-C. (1980) · ACM Transactions on Mathematical Software · doi:10.1145/355921.355927 · Cited by 314
A Framework for Computational Morphology
(1985) · Machine Intelligence and Pattern Recognition · doi:10.1016/b978-0-444-87806-9.50013-x · Cited by 282
Voronoi Diagram in the Laguerre Geometry and Its Applications
Imai, H., Iri, M., & Murota, K. (1985) · SIAM Journal on Computing · doi:10.1137/0214006 · Cited by 245
AnO(n logn) algorithm for the all-nearest-neighbors Problem
Vaidya, P. M. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187718 · Cited by 232
Location of a Point in a Planar Subdivision and Its Applications
Lee, D., & Preparata, F. P. (1977) · SIAM Journal on Computing · doi:10.1137/0206043 · Cited by 221
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
Supowit, K. J. (1983) · Journal of the ACM · doi:10.1145/2402.322386 · Cited by 161
Journey through Genius: The Great Theorems of Mathematics
Dunham, W. (1990) · Cited by 146
Sacred Geometry: Philosophy and Practice
Lawlor, R. (1982) · Medical Entomology and Zoology · Cited by 113
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
Aggarwal, A., Guibas, L. J., Saxe, J. B., & Shor, P. W. (1987) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/28395.28400 · Cited by 69
Delaunay triangulation and the convex hull ofn points in expected linear time
Maus, A. (1984) · BIT Numerical Mathematics · doi:10.1007/bf01937482 · Cited by 68
A Graph-Theoretical Primal Sketch
Toussaint, G. T. (1988) · Machine intelligence and pattern recognition · doi:10.1016/b978-0-444-70467-2.50019-9 · Cited by 60
Self-citationMoss, W. W. (1967) · Systematic Zoology · doi:10.2307/2412066 · Cited by 42
On the Shape of a Set of Points
Radke, J. (1988) · Machine intelligence and pattern recognition · doi:10.1016/b978-0-444-70467-2.50014-x · Cited by 41
Monotonic Search Networks For Computer Vision Databases
Dearholt, D. W., Gonzales, N., & Kurup, G. (2005) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.1988.754602 · Cited by 30
Segmenting Dot Patterns by Voronoi Diagram Concavity
Fairfield, J. R. C. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767353 · Cited by 29
Su, T.-H., & Chang, R. (1991) · Pattern Recognition · doi:10.1016/0031-3203(91)90064-c · Cited by 16
On constructing the relative neighborhood graphs in EuclideanK-dimensional spaces
Su, T.-H., & Chang, R. (1991) · Computing · doi:10.1007/bf02239166 · Cited by 10
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
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.