The DOI matches its Crossref record.
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
Open accessAbstract
The relative neighborhood graph (RNG) of a set V of pomts in Euchdean space is the graph (V, E), where (p, q) E E iff there is no point z E V such that d(p, z) < d(p, q) and d(q, z) < d(p, q) It is shown that (1) the RNG of n points in the' plane can be found in O(n log n) time, which is optimal to wRlun a multiphcative constant.(2) The RNG, as well as the minimum spanning tree, of the vertices of a convex, n-vertex polygon can be found m O(n) time, given the vertices m sorted clockwise order.(3) Under the assumption that no three input points form an isosceles triangle, the RNG of n points m rdimensional space can be found m O(n 2) time for fixed r >_ 3.Categories and SubJect Descriptors: F
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
Cited by
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
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
Relative neighborhood graphs and their relatives
Jaromczyk, J. W., & Toussaint, G. T. (1992) · Proceedings of the IEEE · doi:10.1109/5.163414 · Cited by 664
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
A Framework for Computational Morphology
(1985) · Machine Intelligence and Pattern Recognition · doi:10.1016/b978-0-444-87806-9.50013-x · Cited by 282
Metadata
- Authors
- Supowit, K. J.
- Venue
- Journal of the ACM
- Published
- 1983-07
- Volume
- 30
- Issue
- 3
- Pages
- 428-448
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1968721698
- Cited by
- 161
- References
- 0
- FWCI
- 6.21
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees. https://app.cochat.ai/papers/10.1145/2402.322386
- The paper
- Supowit, K. J. (1983). The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees. Journal of the ACM. https://doi.org/10.1145/2402.322386
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.