On the public citation graph
A Note on Locating a Set of Points in a Planar Subdivision
0 signed · 19 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.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
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-19487-8_7openalex-snapshot
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_26openalex-snapshot
Internal and external algorithms for the points-in-regions problem — the INSIDE join of geo-relational algebra
inferred← citeshttps://doi.org/10.1007/3-540-51084-2_31openalex-snapshot
Tetrahedrizing point sets in three dimensions
inferred← citeshttps://doi.org/10.1007/bf01008046openalex-snapshot
Computing largest empty circles with location constraints
inferred← citeshttps://doi.org/10.1007/bf01840388openalex-snapshot
Internal and external algorithms for the points-in-regions problem—the inside join of geo-relational algebra
inferred← citeshttps://doi.org/10.1007/bf01840442openalex-snapshot
Geometric complexity of some location problems
inferred← citeshttps://doi.org/10.1007/bf02153649openalex-snapshot
Surface representations based on triangular grids
inferred← citeshttps://doi.org/10.1007/bfb0030329openalex-snapshot
Solving visibility problems by using skeleton structures
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80040-6openalex-snapshot
Geometric retrieval problems
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80068-5openalex-snapshot
Tetrahedrizing point sets in three dimensions†
inferred← citeshttps://doi.org/10.1070/rm1981v036n06abeh003102openalex-snapshot
Complexity problems in computational theory
inferred← citeshttps://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
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/s0097539796307790openalex-snapshot
Approximation Algorithms for Curvature-Constrained Shortest Paths
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.5555/313852.314093openalex-snapshot
Approximation algorithms for curvature-constrained shortest paths
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.