On the public citation graph
Implicitly representing arrangements of lines or segments
0 signed · 95 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/3-540-19487-8_7openalex-snapshot
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
inferredcites →https://doi.org/10.1007/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01840441openalex-snapshot
Fractional cascading: II. Applications
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferredcites →https://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1016/0020-0190(86)90088-8openalex-snapshot
Halfplanar range search in linear space and O(n0.695) query time
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0022-0000(89)90041-xopenalex-snapshot
Optimal shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1051/ita/1991250201031openalex-snapshot
Spanning trees with low crossing number
inferredcites →https://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferredcites →https://doi.org/10.1109/sfcs.1988.21975openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/323233.323252openalex-snapshot
Visibility and intersectin problems in plane geometry
inferredcites →https://doi.org/10.1145/41958.41964openalex-snapshot
Optimal shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73397openalex-snapshot
Partition trees for triangle counting and other range searching problems
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.73432openalex-snapshot
Triangles in space or building (and analyzing) castles in the Air
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
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-55488-2_30openalex-snapshot
On spanning trees with low crossing numbers
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_96openalex-snapshot
Implicit point location in arrangements of line segments, with an application to motion planning
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_61openalex-snapshot
Computing common tangents without a separating line
inferred← citeshttps://doi.org/10.1007/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1007/bf01931656openalex-snapshot
Storing line segments in partition trees
inferred← citeshttps://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferred← citeshttps://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferred← citeshttps://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferred← citeshttps://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferred← citeshttps://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferred← citeshttps://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferred← citeshttps://doi.org/10.1007/bf02187785openalex-snapshot
The complexity of many cells in arrangements of planes and related problems
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferred← citeshttps://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferred← citeshttps://doi.org/10.1007/bf02189304openalex-snapshot
Applications of a new space-partitioning technique
inferred← citeshttps://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferred← citeshttps://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1007/bf02712875openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1007/bfb0028277openalex-snapshot
Applications of a new space partitioning technique
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/s00454-003-2949-yopenalex-snapshot
Testing Homotopy for Paths in the Plane
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90129-5openalex-snapshot
Rectilinear decompositions with low stabbing number
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90021-4openalex-snapshot
Good splitters for counting points in triangles
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90062-hopenalex-snapshot
Algorithms for ray-shooting and intersection searching
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00127-xopenalex-snapshot
On counting point-hyperplane incidences
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00055-3openalex-snapshot
Queries with segments in Voronoi diagrams
inferred← citeshttps://doi.org/10.1051/ita/1991250201031openalex-snapshot
Spanning trees with low crossing number
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21928openalex-snapshot
Predicting (0, 1)-functions on randomly drawn points
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21970openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267792openalex-snapshot
Optimal parallel hull construction for simple polygons in O(log log n) time
inferred← citeshttps://doi.org/10.1137/0219020openalex-snapshot
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
inferred← citeshttps://doi.org/10.1137/0220013openalex-snapshot
Approximate Levels in Line Arrangements
inferred← citeshttps://doi.org/10.1137/0221035openalex-snapshot
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
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.1145/142675.142732openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1145/1810959.1811020openalex-snapshot
Computing similarity between piecewise-linear functions
inferred← citeshttps://doi.org/10.1145/220279.220293openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/513400.513421openalex-snapshot
Testing Homotopy for paths in the plane
inferred← citeshttps://doi.org/10.1145/73393.73401openalex-snapshot
Red-Blue intersection detection algorithms, with applications to motion planning and collision detection
inferred← citeshttps://doi.org/10.1145/73833.73835openalex-snapshot
A deterministic algorithm for partitioning arrangements of lines and its application
inferred← citeshttps://doi.org/10.1145/73833.73847openalex-snapshot
Good splitters for counting points in triangles
inferred← citeshttps://doi.org/10.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
inferred← citeshttps://doi.org/10.1145/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1145/98524.98537openalex-snapshot
Minimum-link paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1155/1994/20983openalex-snapshot
On the Minimum Density Interconnection TreeProblem
inferred← citeshttps://doi.org/10.22215/etd/2008-07701openalex-snapshot
Cutting a polygon with a line
inferred← citeshttps://doi.org/10.48550/arxiv.2002.08198openalex-snapshot
The Tree Stabbing Number is not Monotone
inferred← citeshttps://doi.org/10.5555/127787.127797openalex-snapshot
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications
inferred← citeshttps://doi.org/10.5555/93025.93102openalex-snapshot
Predicting {0,1}-functions on randomly drawn points
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.