On the public citation graph

The region approach for computing relative neighbourhood graphs in the Lp metric

0 signed · 59 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf00263991openalex-snapshot
Efficient worst-case data structures for range searching
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(83)90045-5openalex-snapshot
On computing all north-east nearest neighbors in the L1 metric
inferredcites →https://doi.org/10.1016/0020-0190(87)90225-0openalex-snapshot
A linear expected-time algorithm for computing planar relative neighbourhood graphs
inferredcites →https://doi.org/10.1016/0031-3203(80)90066-7openalex-snapshot
The relative neighbourhood graph of a finite planar set
inferredcites →https://doi.org/10.1016/0031-3203(82)90070-xopenalex-snapshot
Computing the relative neighborhood graph in the L1 and L∞ metrics
inferredcites →https://doi.org/10.1016/0031-3203(85)90023-8openalex-snapshot
Relative neighborhood graphs in the Li-metric
inferredcites →https://doi.org/10.1016/0031-3203(86)90012-9openalex-snapshot
Computing relative neighbourhood graphs in the plane
inferredcites →https://doi.org/10.1016/0167-8655(83)90070-3openalex-snapshot
Some properties of the planar Euclidean relative neighbourhood graph
inferredcites →https://doi.org/10.1016/0196-6774(85)90030-6openalex-snapshot
Batched dynamic solutions to decomposable searching problems
inferredcites →https://doi.org/10.1049/el:19800386openalex-snapshot
Algorithms for computation of relative neighbourhood graph
inferredcites →https://doi.org/10.1049/el:19800611openalex-snapshot
Comment: Algorithms for computing relative neighbourhood graph
inferredcites →https://doi.org/10.1051/ita/1987210201991openalex-snapshot
An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0211059openalex-snapshot
On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems
inferredcites →https://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferredcites →https://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1145/2402.322386openalex-snapshot
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/355921.355927openalex-snapshot
Optimal Expected-Time Algorithms for Closest Point Problems
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/41958.41983openalex-snapshot
A note on relative neighborhood graphs
inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems
inferredcites →https://doi.org/10.1147/rd.236.0696openalex-snapshot
An Elementary Proof of Nonexistence of Isometries between ℓpk and ℓqk
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/wcm.107openalex-snapshot
Algorithmic, geometric and graphs issues in wireless networks
inferred← citeshttps://doi.org/10.1007/11546924_91openalex-snapshot
An Effective Method for Locally Neighborhood Graphs Updating
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_15openalex-snapshot
A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4613-0223-0_7openalex-snapshot
Applications of Computational Geometry in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-69423-6_57openalex-snapshot
Neighborhood Graphs for Semi-automatic Annotation of Large Image Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-72665-4_35openalex-snapshot
Incremental Neighborhood Graphs Construction for Multidimensional Databases Indexing
inferred← citeshttps://doi.org/10.1007/bf01188713openalex-snapshot
Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
inferred← citeshttps://doi.org/10.1007/bf02017341openalex-snapshot
A divide-and-conquer algorithm for constructing relative neighborhood graph
inferred← citeshttps://doi.org/10.1007/bf02239166openalex-snapshot
On constructing the relative neighborhood graphs in EuclideanK-dimensional spaces
inferred← citeshttps://doi.org/10.1007/s10844-009-0081-zopenalex-snapshot
Neighborhood graphs for indexing and retrieving multi-dimensional data
inferred← citeshttps://doi.org/10.1007/s12083-010-0077-zopenalex-snapshot
Sparse structures for searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90225-0openalex-snapshot
A linear expected-time algorithm for computing planar relative neighbourhood graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90139-oopenalex-snapshot
On the angle restricted nearest neighbor problem
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90064-copenalex-snapshot
Computing the constrained relative neighborhood graphs and constrained gabriel graphs in Euclidean plane
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90065-dopenalex-snapshot
Computing the k-relative neighborhood graphs in Euclidean plane
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90017-mopenalex-snapshot
Relative neighborhood graphs in three dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.002openalex-snapshot
Survivable minimum bottleneck networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.07.003openalex-snapshot
On the symmetric angle-restricted nearest neighbor problem
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00030-xopenalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1109/5.163414openalex-snapshot
Relative neighborhood graphs and their relatives
inferred← citeshttps://doi.org/10.1109/aiccsa.2005.1387016openalex-snapshot
RNG-based searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems
inferred← citeshttps://doi.org/10.1109/hicss.2002.994518openalex-snapshot
Sparse power efficient topology for wireless networks
inferred← citeshttps://doi.org/10.1109/icccn.2001.956322openalex-snapshot
Power efficient and sparse spanner for wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019377openalex-snapshot
Distributed construction of a planar spanner and routing for ad hoc wireless networks
inferred← citeshttps://doi.org/10.1109/mmmc.2006.1651337openalex-snapshot
Content-Based Image Retrieval Using Topological Models
inferred← citeshttps://doi.org/10.1109/tpds.2003.1239871openalex-snapshot
Localized Delaunay triangulation with application in ad hoc wireless networks
inferred← citeshttps://doi.org/10.1109/tpds.2007.1004openalex-snapshot
The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1142/s0129054103001674openalex-snapshot
DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS
inferred← citeshttps://doi.org/10.1142/s021819591850005xopenalex-snapshot
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
inferred← citeshttps://doi.org/10.1145/100348.100356openalex-snapshot
Computing geographic nearest neighbors using monotone matrix searching (preliminary version)
inferred← citeshttps://doi.org/10.1201/9780203489635.ch39openalex-snapshot
Wireless Sensor Networks and Computational Geometry
inferred← citeshttps://doi.org/10.4018/978-1-59904-370-8.ch011openalex-snapshot
A Machine Learning-Based Model for Content-Based Image Retrieval
inferred← citeshttps://doi.org/10.4018/978-1-60566-174-2.ch008openalex-snapshot
A Machine Learning-Based Model for Content-Based Image Retrieval
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.