On the public citation graph
An optimal algorithm for the boundary of a cell in a union of rays
0 signed · 32 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/323233.323252openalex-snapshot
Visibility and intersectin problems in plane geometry
inferredcites →https://doi.org/10.1145/41958.41975openalex-snapshot
An optimal O(n log n) algorithm for contour reconstruction from rays
inferredcites →https://doi.org/10.1145/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferredcites →https://doi.org/10.1145/73393.73423openalex-snapshot
On the general motion planning problem with two degrees of freedom
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-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
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/bf01258293openalex-snapshot
Robot motion planning and the single cell problem in arrangements
inferred← citeshttps://doi.org/10.1007/bf01759047openalex-snapshot
An optimal algorithm for the boundary of a cell in a union of rays—corrigendum
inferred← citeshttps://doi.org/10.1007/bf02574043openalex-snapshot
Arrangements of segments that share endpoints: Single face results
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90018-2openalex-snapshot
On the union of fat wedges and separating a collection of segments by a line
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00005-8openalex-snapshot
Computing depth orders for fat objects and related problems
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/j.comgeo.2014.12.001openalex-snapshot
On the zone of the boundary of a convex body
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102185openalex-snapshot
Parallel line centers with guaranteed separation
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00004-1openalex-snapshot
The common exterior of convex polygons in the plane
inferred← citeshttps://doi.org/10.1051/ita/1992260503871openalex-snapshot
Enumerating Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1109/im.1997.603849openalex-snapshot
Automatic 3-D digitization using a laser rangefinder with a small field of view
inferred← citeshttps://doi.org/10.1137/0222077openalex-snapshot
Computing a Face in an Arrangement of Line Segments and Related Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977066.7openalex-snapshot
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines
inferred← citeshttps://doi.org/10.1137/1.9781611977073.123openalex-snapshot
Constructing Many Faces in Arrangements of Lines and Segments
inferred← citeshttps://doi.org/10.1137/21m145118xopenalex-snapshot
Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments
inferred← citeshttps://doi.org/10.1142/s0218195919500079openalex-snapshot
Weighted Voronoi Diagrams in the Maximum Norm
inferred← citeshttps://doi.org/10.1145/109648.109684openalex-snapshot
Arrangements of segments that share endpoints
inferred← citeshttps://doi.org/10.48550/arxiv.1108.4336openalex-snapshot
Complexity of a Single Face in an Arrangement of s-Intersecting Curves
inferred← citeshttps://doi.org/10.48550/arxiv.1306.2104openalex-snapshot
On the zone of the boundary of a convex body
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.