On the public citation graph

Applications of a new space partitioning technique

https://doi.org/10.1007/bfb0028277
0 signed · 47 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-55488-2_30openalex-snapshot
On spanning trees with low crossing numbers
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_42openalex-snapshot
Ray Tracing Algorithms — Theory and Practice
inferredcites →https://doi.org/10.1007/bf01293267openalex-snapshot
An improved technique for output-sensitive hidden surface removal
inferredcites →https://doi.org/10.1007/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
inferredcites →https://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferredcites →https://doi.org/10.1007/bfb0028245openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1016/0196-6774(85)90007-0openalex-snapshot
A linear algorithm for determining the separation of convex polyhedra
inferredcites →https://doi.org/10.1016/0196-6774(87)90015-0openalex-snapshot
Space searching for intersecting objects
inferredcites →https://doi.org/10.1109/sfcs.1989.63541openalex-snapshot
Output-sensitive hidden surface removal
inferredcites →https://doi.org/10.1137/0221035openalex-snapshot
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
inferredcites →https://doi.org/10.1145/109648.109651openalex-snapshot
Efficient ray shooting and hidden surface removal
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/73833.73835openalex-snapshot
A deterministic algorithm for partitioning arrangements of lines and its application
inferredcites →https://doi.org/10.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
inferredcites →https://doi.org/10.1145/98524.98528openalex-snapshot
Cutting hyperplane arrangements
inferredcites →https://doi.org/10.1145/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferredcites →https://doi.org/10.1145/98524.98561openalex-snapshot
Merging visibility maps
inferredcites →https://doi.org/10.1145/98524.98563openalex-snapshot
Stabbing and ray shooting in 3 dimensional space
inferredcites →https://doi.org/10.5555/127787.127797openalex-snapshot
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1995.0797openalex-snapshot
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
inferred← citeshttps://doi.org/10.1006/jagm.1996.0038openalex-snapshot
Repetitive Hidden Surface Removal for Polyhedra
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-55808-x_1openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_278openalex-snapshot
Repetitive hidden-surface-removal for polyhedral scenes
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_10openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_43openalex-snapshot
Ray Shooting and Stone Throwing
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_16openalex-snapshot
Processing an Offline Insertion-Query Sequence with Applications
inferred← citeshttps://doi.org/10.1007/bf01182772openalex-snapshot
Variations on ray shooting
inferred← citeshttps://doi.org/10.1007/bf01187036openalex-snapshot
Ray shooting on triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bf01377182openalex-snapshot
Efficient ray shooting and hidden surface removal
inferred← citeshttps://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1007/bfb0028246openalex-snapshot
Ray-shooting and isotopy classes of lines in 3-dimensional space
inferred← citeshttps://doi.org/10.1007/pl00009479openalex-snapshot
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
inferred← citeshttps://doi.org/10.1007/pl00009500openalex-snapshot
Efficient Algorithms for Approximating Polygonal Chains
inferred← citeshttps://doi.org/10.1007/s00454-003-2924-7openalex-snapshot
Segment Intersection Searching Problems in General Settings
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90025-5openalex-snapshot
The power of parallel projection
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/0925-7721(92)90007-fopenalex-snapshot
Hidden surface removal for c-oriented polyhedra
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/cgi.1998.694246openalex-snapshot
Determining visibility between extended objects
inferred← citeshttps://doi.org/10.1145/109648.109649openalex-snapshot
Efficient partition trees
inferred← citeshttps://doi.org/10.1145/142675.142703openalex-snapshot
Incidence and nearest-neighbor problems for lines in 3-space
inferred← citeshttps://doi.org/10.1145/142675.142730openalex-snapshot
How hard is halfspace range searching?
inferred← citeshttps://doi.org/10.1145/142675.142732openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1145/177424.177576openalex-snapshot
Determining the castability of simple polyhedra
inferred← citeshttps://doi.org/10.5555/313559.313610openalex-snapshot
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
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.