On the public citation graph

An algorithm for segment-dragging and its implementation

https://doi.org/10.1007/bf01762115
0 signed · 58 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.1016/0734-189x(84)90142-7openalex-snapshot
Some methods of computational geometry applied to computer graphics
inferredcites →https://doi.org/10.1137/0217026openalex-snapshot
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11841036_37openalex-snapshot
Region-Restricted Clustering for Geographic Data Mining
inferred← citeshttps://doi.org/10.1007/11940128_20openalex-snapshot
Optimal Construction of the City Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_38openalex-snapshot
Computing Homotopic Shortest Paths Efficiently
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_64openalex-snapshot
On geometric path query problems
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_6openalex-snapshot
Maximum-Width Empty Square and Rectangular Annulus
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_38openalex-snapshot
Geometric Hitting Set for Line-Constrained Disks
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_37openalex-snapshot
Encoding Homotopy of Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_10openalex-snapshot
Validity Information Retrieval for Spatio-Temporal Queries: Theoretical Performance Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_7openalex-snapshot
All Farthest Neighbors in the Presence of Highways and Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_15openalex-snapshot
Square and Rectangle Covering with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-642-22922-0_19openalex-snapshot
MSSQ: Manhattan Spatial Skyline Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_7openalex-snapshot
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_61openalex-snapshot
Outlier Respecting Points Approximation
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_6openalex-snapshot
Group Nearest Neighbor Queries in the L 1 Plane
inferred← citeshttps://doi.org/10.1007/bf01582074openalex-snapshot
The pin redistribution problem in multi-chip modules
inferred← citeshttps://doi.org/10.1007/bf01758836openalex-snapshot
L 1 shortest paths among polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/s00453-012-9738-zopenalex-snapshot
Outlier Respecting Points Approximation
inferred← citeshttps://doi.org/10.1007/s00453-013-9809-9openalex-snapshot
The k-Nearest-Neighbor Voronoi Diagram Revisited
inferred← citeshttps://doi.org/10.1007/s00454-003-2949-yopenalex-snapshot
Testing Homotopy for Paths in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-019-00112-yopenalex-snapshot
Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90046-zopenalex-snapshot
Parallel algorithms for the segment dragging problem
inferred← citeshttps://doi.org/10.1016/0166-218x(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.11.002openalex-snapshot
Schematization of networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.03.003openalex-snapshot
Computing homotopic shortest paths efficiently
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.08.003openalex-snapshot
Region-restricted clustering for geographic data mining
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.10.002openalex-snapshot
Covering points by disjoint boxes with outliers
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.02.002openalex-snapshot
Computing homotopic line simplification
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.10.007openalex-snapshot
Optimal time-convex hull for a straight-line highway in L-metrics
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102196openalex-snapshot
Algorithms for computing closest points for segments
inferred← citeshttps://doi.org/10.1016/j.is.2013.10.001openalex-snapshot
MSSQ: Manhattan Spatial Skyline Queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.015openalex-snapshot
Computing closest and farthest points for a query segment
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.011openalex-snapshot
Group nearest-neighbor queries in the L1 plane
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00090-7openalex-snapshot
Computing homotopic shortest paths in the plane
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00055-3openalex-snapshot
Queries with segments in Voronoi diagrams
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1109/12.286304openalex-snapshot
On bends and distances of paths among obstacles in two-layer interconnection model
inferred← citeshttps://doi.org/10.1109/asic.1991.242927openalex-snapshot
The pin redistribution problem in multi-chip modules
inferred← citeshttps://doi.org/10.1109/csicc49403.2020.9050086openalex-snapshot
Maximum Separability by L-shapes
inferred← citeshttps://doi.org/10.1109/tcad.2014.2363390openalex-snapshot
Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction
inferred← citeshttps://doi.org/10.1137/s0097539792229672openalex-snapshot
Rectilinear Path Problems among Rectilinear Obstacles Revisited
inferred← citeshttps://doi.org/10.1142/s021819590900285xopenalex-snapshot
OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM
inferred← citeshttps://doi.org/10.1142/s0218195915500053openalex-snapshot
Aggregate-MAX Top-k Nearest Neighbor Searching in the L1 Plane
inferred← citeshttps://doi.org/10.1142/s0218195919500055openalex-snapshot
On Top-k Weighted Sum Aggregate Nearest and Farthest Neighbors in the L1 Plane
inferred← citeshttps://doi.org/10.1145/160985.161156openalex-snapshot
Shortest paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1145/1629911.1629998openalex-snapshot
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction
inferred← citeshttps://doi.org/10.1145/1989284.1989297openalex-snapshot
New results on two-dimensional orthogonal range aggregation in external memory
inferred← citeshttps://doi.org/10.1145/2228360.2228471openalex-snapshot
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction
inferred← citeshttps://doi.org/10.1145/513400.513421openalex-snapshot
Testing Homotopy for paths in the plane
inferred← citeshttps://doi.org/10.48550/arxiv.1211.5084openalex-snapshot
On Top-$k$ Weighted SUM Aggregate Nearest and Farthest Neighbors in the $L_1$ Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1309.1807openalex-snapshot
Aggregate-Max Nearest Neighbor Searching in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1703.04466openalex-snapshot
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.2106.15885openalex-snapshot
Optimal Construction for Time-Convex Hull with Two Orthogonal Highways in the L1-metric
inferred← citeshttps://doi.org/10.5555/644108.644209openalex-snapshot
Computing homotopic shortest paths in the plane
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.