On the public citation graph

Characterizing Proximity Trees

https://doi.org/10.1007/bf02086609

0 signed · 72 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/3-540-55719-9_93openalex-snapshot

On nearest-neighbor graphs

inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot

Graph Theory with Applications

inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/bf02293049openalex-snapshot

Transitions in geometric minimum spanning trees

inferredcites →https://doi.org/10.1016/0012-365x(95)00276-3openalex-snapshot

Graph-theoretical conditions for inscribability and Delaunay realizability

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/0167-8655(83)90070-3openalex-snapshot

Some properties of the planar Euclidean relative neighbourhood graph

inferredcites →https://doi.org/10.1016/0167-8655(92)90048-5openalex-snapshot

Properties of some Euclidean proximity graphs

inferredcites →https://doi.org/10.1016/0262-8856(89)90037-1openalex-snapshot

Computational morphology

inferredcites →https://doi.org/10.1016/0893-9659(95)00091-4openalex-snapshot

Trees that are sphere-of-influence graphs

inferredcites →https://doi.org/10.1016/0925-7721(92)90003-bopenalex-snapshot

The γ-neighborhood graph

inferredcites →https://doi.org/10.1016/0925-7721(92)90017-mopenalex-snapshot

Relative neighborhood graphs in three dimensions

inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot

Algorithms for drawing graphs: an annotated bibliography

inferredcites →https://doi.org/10.1016/b978-0-444-70467-2.50014-xopenalex-snapshot

On the Shape of a Set of Points

inferredcites →https://doi.org/10.1016/b978-0-444-70467-2.50019-9openalex-snapshot

A Graph-Theoretical Primal Sketch

inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50013-xopenalex-snapshot

A Framework for Computational Morphology

inferredcites →https://doi.org/10.1016/s0925-7721(01)00030-xopenalex-snapshot

Editorial

inferredcites →https://doi.org/10.1109/5.163414openalex-snapshot

Relative neighborhood graphs and their relatives

inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot

Closest-point problems

inferredcites →https://doi.org/10.1109/sfcs.1991.185400openalex-snapshot

A quadratic time algorithm for the minmax length triangulation

inferredcites →https://doi.org/10.1109/tit.1983.1056714openalex-snapshot

On the shape of a set of points in the plane

inferredcites →https://doi.org/10.1111/j.1538-4632.1969.tb00615.xopenalex-snapshot

Regionalization: Theory and Alternative Algorithms

inferredcites →https://doi.org/10.1111/j.1538-4632.1980.tb00031.xopenalex-snapshot

Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane

inferredcites →https://doi.org/10.1145/109648.109675openalex-snapshot

Transitions in geometric minimum spanning trees (extended abstract)

inferredcites →https://doi.org/10.1145/167088.167207openalex-snapshot

Angles of planar triangular graphs

inferredcites →https://doi.org/10.1145/177424.177507openalex-snapshot

The realization problem for Euclidean minimum spanning trees is NP-hard

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/98524.98551openalex-snapshot

Slimming down by adding; selecting heavily covered points

inferredcites →https://doi.org/10.2307/2008200openalex-snapshot

Computational Geometry--An Introduction.

inferredcites →https://doi.org/10.2307/2412323openalex-snapshot

A New Statistical Approach to Geographic Variation Analysis

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-37623-2_21openalex-snapshot

Proximity Drawings: Three Dimensions Are Better than Two

inferred← citeshttps://doi.org/10.1007/3-540-44541-2_32openalex-snapshot

Minimum Weight Drawings of Maximal Triangulations

inferred← citeshttps://doi.org/10.1007/3-540-59175-3_93openalex-snapshot

Nearest neighbour graph realizability is NP-hard

inferred← citeshttps://doi.org/10.1007/3-540-60220-8_66openalex-snapshot

Computing proximity drawings of trees in the 3-dimensional space

inferred← citeshttps://doi.org/10.1007/3-540-62495-3_55openalex-snapshot

Proximity drawings of outerplanar graphs (extended abstract)

inferred← citeshttps://doi.org/10.1007/3-540-62592-5_67openalex-snapshot

Area requirement of Gabriel drawings (extended abstract)

inferred← citeshttps://doi.org/10.1007/3-540-63938-1_45openalex-snapshot

Drawable and forbidden minimum weight triangulations

inferred← citeshttps://doi.org/10.1007/3-540-63938-1_47openalex-snapshot

On embedding an outer-planar graph in a point set

inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot

Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area

inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_8openalex-snapshot

Shape-Faithful Graph Drawings

inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot

Selected Open Problems in Graph Drawing

inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_33openalex-snapshot

The Three Dimensional Logic Engine

inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_8openalex-snapshot

Computing β-Drawings of 2-Outerplane Graphs in Linear Time

inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_3openalex-snapshot

On the Area Requirements of Euclidean Minimum Spanning Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_17openalex-snapshot

Approximate Proximity Drawings

inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_11openalex-snapshot

The Approximate Rectangle of Influence Drawability Problem

inferred← citeshttps://doi.org/10.1007/bf02086608openalex-snapshot

The realization problem for Euclidean minimum spanning trees is NP-hard

inferred← citeshttps://doi.org/10.1007/bfb0021791openalex-snapshot

Optimal algorithms to embed trees in a point set

inferred← citeshttps://doi.org/10.1007/bfb0021802openalex-snapshot

The strength of weak proximity (extended abstract)

inferred← citeshttps://doi.org/10.1007/s00453-013-9866-0openalex-snapshot

The Approximate Rectangle of Influence Drawability Problem

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50022-xopenalex-snapshot

Graph Drawing**Work supported in part by the National Science Foundation under grant CCR-9732327, and by the U.S. Army Research Office under grant DAAH04-96-1-0013.

inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.03.015openalex-snapshot

Proximity drawings in polynomial area and volume

inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.09.003openalex-snapshot

Empty region graphs

inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.01.001openalex-snapshot

Witness (Delaunay) graphs

inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.05.005openalex-snapshot

Polynomial area bounds for MST embeddings of trees

inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.10.011openalex-snapshot

On the area requirements of Euclidean minimum spanning trees

inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.01.001openalex-snapshot

Approximate proximity drawings

inferred← citeshttps://doi.org/10.1016/j.jda.2005.12.004openalex-snapshot

The strength of weak proximity

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00383-2openalex-snapshot

The drawability problem for minimum weight triangulations

inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00069-4openalex-snapshot

On embedding an outer-planar graph in a point set

inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00137-2openalex-snapshot

Voronoi drawings of trees

inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00018-7openalex-snapshot

The rectangle of influence drawability problem

inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00038-8openalex-snapshot

Visualizing geometric algorithms over the Web

inferred← citeshttps://doi.org/10.1109/icict.2007.375362openalex-snapshot

Current Research on Planar Graphs

inferred← citeshttps://doi.org/10.1109/pacificvis64226.2025.00009openalex-snapshot

dcGG, dcRNG: New Degree-Constrained Shape-Based Faithfulness Metrics

inferred← citeshttps://doi.org/10.1142/s0218195913500088openalex-snapshot

PROXIMITY DRAWINGS OF HIGH-DEGREE TREES

inferred← citeshttps://doi.org/10.1201/b16132-53openalex-snapshot

Graphs and Finite Geometries

inferred← citeshttps://doi.org/10.1201/b16132-73openalex-snapshot

Drawings of Graphs

inferred← citeshttps://doi.org/10.3923/jas.2011.3221.3232openalex-snapshot

Connection Subgraphs: A Survey

inferred← citeshttps://doi.org/10.48550/arxiv.1410.1006openalex-snapshot

A Survey on Small-Area Planar Graph Drawing

inferred← citeshttps://doi.org/10.54419/040bxcopenalex-snapshot

Segmentation and Classification of Airborne Laser Scanner Data

inferred← citeshttps://doi.org/10.7155/jgaa.00002openalex-snapshot

Optimal Algorithms to Embed Trees in a Point Set

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.