On the public citation graph

Connected component and simple polygon intersection searching

https://doi.org/10.1007/bf01940884
0 signed · 44 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.1006/jagm.1993.1040openalex-snapshot
Intersection Queries in Curved Objects
inferredcites →https://doi.org/10.1006/jagm.1995.1038openalex-snapshot
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
inferredcites →https://doi.org/10.1007/3-540-57155-8_262openalex-snapshot
Further results on generalized intersection searching problems: Counting, reporting, and dynamization
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-69900-9openalex-snapshot
Data Structures and Algorithms 3
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/bf01182772openalex-snapshot
Variations on ray shooting
inferredcites →https://doi.org/10.1007/bf01285815openalex-snapshot
The number of edges of many faces in a line segment arrangement
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/bf01931656openalex-snapshot
Storing line segments in partition trees
inferredcites →https://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferredcites →https://doi.org/10.1007/bf02189304openalex-snapshot
Applications of a new space-partitioning technique
inferredcites →https://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0196-6774(83)90012-3openalex-snapshot
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
inferredcites →https://doi.org/10.1016/0196-6774(87)90015-0openalex-snapshot
Space searching for intersecting objects
inferredcites →https://doi.org/10.1016/0196-6774(92)90062-hopenalex-snapshot
Algorithms for ray-shooting and intersection searching
inferredcites →https://doi.org/10.1016/s0747-7171(89)80002-1openalex-snapshot
General methods for adding range restrictions to decomposable searching problems
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1093/comjnl/36.2.107openalex-snapshot
Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects
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.1137/0606031openalex-snapshot
Amortized Computational Complexity
inferredcites →https://doi.org/10.1142/s021819599300004xopenalex-snapshot
GENERALIZED INTERSECTION SEARCHING PROBLEMS
inferredcites →https://doi.org/10.1145/109648.109649openalex-snapshot
Efficient partition trees
inferredcites →https://doi.org/10.1145/128749.128750openalex-snapshot
A general approach to connected-component labeling for arbitrary image representations
inferredcites →https://doi.org/10.1145/177424.178096openalex-snapshot
Efficient algorithms for generalized intersection searching on non-iso-oriented objects
inferredcites →https://doi.org/10.1145/359131.359132openalex-snapshot
An optimal real-time algorithm for planar convex hulls
inferredcites →https://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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.1006/jagm.1995.1038openalex-snapshot
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
inferred← citeshttps://doi.org/10.1007/11533719_55openalex-snapshot
Efficient Non-intersection Queries on Aggregated Geometric Data
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00012-7openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00183-xopenalex-snapshot
A technique for adding range restrictions to generalized searching problems
inferred← citeshttps://doi.org/10.1093/comjnl/40.1.22openalex-snapshot
New Results on Intersection Query Problems
inferred← citeshttps://doi.org/10.1109/focs.2008.29openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1109/mwscas.2006.382320openalex-snapshot
A practical algorithm for connectivity extraction for very large VLSI layouts
inferred← citeshttps://doi.org/10.1137/090751670openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
inferred← citeshttps://doi.org/10.1137/s009753970343912xopenalex-snapshot
Dynamic Subgraph Connectivity with Geometric Applications
inferred← citeshttps://doi.org/10.1142/s0218195909003088openalex-snapshot
EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA
inferred← citeshttps://doi.org/10.1145/509907.509911openalex-snapshot
Dynamic subgraph connectivity with geometric applications
inferred← citeshttps://doi.org/10.48550/arxiv.0808.1128openalex-snapshot
Dynamic Connectivity: Connecting to Networks and Geometry
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.