On the public citation graph

On minimum and maximum spanning trees of linearly moving points

https://doi.org/10.1007/bf02574035
0 signed · 45 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-55121-2_11openalex-snapshot
Voronoi diagrams of moving points in the plane
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02293049openalex-snapshot
Transitions in geometric minimum spanning trees
inferredcites →https://doi.org/10.1007/bf02574363openalex-snapshot
On the number of minimal 1-Steiner trees
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1016/0898-1221(85)90105-1openalex-snapshot
Some dynamic computational geometry problems
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/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1142/s0218195991000037openalex-snapshot
VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
inferredcites →https://doi.org/10.1142/s021819599200010xopenalex-snapshot
THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
inferredcites →https://doi.org/10.1145/109648.109675openalex-snapshot
Transitions in geometric minimum spanning trees (extended abstract)
inferredcites →https://doi.org/10.1145/2157.322410openalex-snapshot
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
inferredcites →https://doi.org/10.1145/73393.73418openalex-snapshot
Computing Euclidean maximum spanning trees
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.3929/ethz-a-006651382openalex-snapshot
Voronoi diagrams of moving points

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_52openalex-snapshot
Directional Geometric Routing on Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_21openalex-snapshot
Kinetic Euclidean Minimum Spanning Tree in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_5openalex-snapshot
Kinetic Pie Delaunay Graph and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/bfb0030828openalex-snapshot
The multi-weighted spanning tree problem
inferred← citeshttps://doi.org/10.1007/bfb0054308openalex-snapshot
Faster non-linear parametric search with applications to optimization and dynamic geometry
inferred← citeshttps://doi.org/10.1007/pl00009348openalex-snapshot
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%
inferred← citeshttps://doi.org/10.1007/pl00009396openalex-snapshot
Geometric Lower Bounds for Parametric Matroid Optimization
inferred← citeshttps://doi.org/10.1007/s00454-001-0086-zopenalex-snapshot
K-Levels of Concave Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-002-2840-2openalex-snapshot
On Levels in Arrangements of Curves
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00044-5openalex-snapshot
Near-quadratic bounds for the L1 Voronoi diagram of moving points
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.12.002openalex-snapshot
A simple, faster method for kinetic proximity problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.02.005openalex-snapshot
Cross-sections of line configurations in R3 and (d− 2)-flat configurations in Rd
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101775openalex-snapshot
Bisecting three classes of lines
inferred← citeshttps://doi.org/10.1016/j.physa.2013.08.001openalex-snapshot
Spanning trees and the Eurozone crisis
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00107-6openalex-snapshot
Structural tolerance and Delaunay triangulation
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892109openalex-snapshot
On levels in arrangements of curves
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814610openalex-snapshot
Lovasz's lemma for the three-dimensional K-level of concave surfaces and its applications
inferred← citeshttps://doi.org/10.1142/s0218195902000967openalex-snapshot
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0218195903001050openalex-snapshot
PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
inferred← citeshttps://doi.org/10.1145/225058.225284openalex-snapshot
Geometric lower bounds for parametric matroid optimization
inferred← citeshttps://doi.org/10.1145/262839.262998openalex-snapshot
Proximity problems on moving points
inferred← citeshttps://doi.org/10.1145/262839.263075openalex-snapshot
Probabilistic analysis for combinatorial functions of moving points
inferred← citeshttps://doi.org/10.1145/378583.378675openalex-snapshot
Notes on computing peaks in k-levels and parametric spanning trees
inferred← citeshttps://doi.org/10.11606/d.45.2000.tde-20210729-205459openalex-snapshot
Geometria computacional de pontos em movimento
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2032openalex-snapshot
A Simple, Faster Method for Kinetic Proximity Problems
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.