On the public citation graph

Range searching and point location among fat objects

https://doi.org/10.1007/bfb0049412
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.
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-51542-9_2openalex-snapshot
Efficient spatial point location
inferredcites →https://doi.org/10.1007/3-540-55808-x_1openalex-snapshot
On range searching with semialgebraic sets
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01758853openalex-snapshot
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
inferredcites →https://doi.org/10.1007/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferredcites →https://doi.org/10.1007/bf01840386openalex-snapshot
Dynamic fractional cascading
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferredcites →https://doi.org/10.1007/bf02293051openalex-snapshot
Efficient partition trees
inferredcites →https://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferredcites →https://doi.org/10.1016/0020-0190(92)90211-dopenalex-snapshot
Point location in fat subdivisions
inferredcites →https://doi.org/10.1016/0925-7721(93)90007-sopenalex-snapshot
The complexity of the free space for a robot moving amidst fat obstacles
inferredcites →https://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot
How to search in history
inferredcites →https://doi.org/10.1137/0213031openalex-snapshot
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
inferredcites →https://doi.org/10.1137/s009753979018330xopenalex-snapshot
Fat Triangles Determine Linearly Many Holes
inferredcites →https://doi.org/10.1145/103418.103472openalex-snapshot
Dynamic trees and dynamic point location
inferredcites →https://doi.org/10.1145/109648.109649openalex-snapshot
Efficient partition trees
inferredcites →https://doi.org/10.1145/177424.177574openalex-snapshot
Spheres, molecules, and hidden surface removal

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.1996.0063openalex-snapshot
Range Searching and Point Location among Fat Objects
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_69openalex-snapshot
Dynamic data structures for fat objects and their applications
inferred← citeshttps://doi.org/10.1007/s004530010047openalex-snapshot
Linear Size Binary Space Partitions for Uncluttered Scenes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.10.006openalex-snapshot
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00027-2openalex-snapshot
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
inferred← citeshttps://doi.org/10.1016/s1007-0214(11)70062-1openalex-snapshot
High-performance packet classification on multi-core network processing platforms
inferred← citeshttps://doi.org/10.1109/cec.2009.4983115openalex-snapshot
Towards an evolved lower bound for the most circular partition of a square
inferred← citeshttps://doi.org/10.1109/conect.2004.1375197openalex-snapshot
Efficient multi-match packet classification with TCAM
inferred← citeshttps://doi.org/10.1109/nswctc.2009.76openalex-snapshot
A Sequence Encoding Scheme for Multi-match Packet Classification
inferred← citeshttps://doi.org/10.1109/robot.1997.619369openalex-snapshot
A practical motion planning strategy based on a plane-sweep approach
inferred← citeshttps://doi.org/10.1109/tc.2012.191openalex-snapshot
Practical Multituple Packet Classification Using Dynamic Discrete Bit Selection
inferred← citeshttps://doi.org/10.1145/1137856.1137872openalex-snapshot
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
inferred← citeshttps://doi.org/10.1145/203610.606409openalex-snapshot
Technical Report Column
inferred← citeshttps://doi.org/10.1145/262839.262986openalex-snapshot
Realistic input models for geometric algorithms
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.