On the public citation graph

Storing the subdivision of a polyhedral surface

https://doi.org/10.1007/bf02187877
0 signed · 33 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.1016/0196-6774(81)90031-6openalex-snapshot
A linear 5-coloring algorithm of planar graphs
inferredcites →https://doi.org/10.1016/0196-6774(85)90027-6openalex-snapshot
Efficient uses of the past
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1016/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
inferredcites →https://doi.org/10.1137/0210035openalex-snapshot
A New Approach to Planar Point Location
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0214034openalex-snapshot
Intersection and Closest-Pair Problems for a Set of Planar Discs
inferredcites →https://doi.org/10.1137/0215014openalex-snapshot
On Shortest Paths in Polyhedral Spaces
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0216045openalex-snapshot
The Discrete Geodesic Problem
inferredcites →https://doi.org/10.1145/10515.10525openalex-snapshot
Computing convolutions by reciprocal search
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.21236/ada166220openalex-snapshot
Voronoi Diagrams on the Surface of a Polyhedron.
inferredcites →https://doi.org/10.21236/ada166246openalex-snapshot
On Finding Shortest Paths on Convex Polyhedra.

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-47738-1_23openalex-snapshot
Intersecting Red and Blue Line Segments in Optimal Time and Precision
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_40openalex-snapshot
Searching Edges in the Overlap of Two Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00454-007-9031-0openalex-snapshot
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-009-9136-8openalex-snapshot
An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-013-9515-zopenalex-snapshot
Tracing Compressed Curves in Triangulated Surfaces
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.05.006openalex-snapshot
A survey of geodesic paths on 3D surfaces
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101626openalex-snapshot
Shortest paths and convex hulls in 2D complexes with non-positive curvature
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1137/s0097539797325223openalex-snapshot
Constructing Approximate Shortest Path Maps in Three Dimensions
inferred← citeshttps://doi.org/10.1145/1137856.1137862openalex-snapshot
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
inferred← citeshttps://doi.org/10.1145/1247069.1247081openalex-snapshot
Shortest paths on realistic polyhedra
inferred← citeshttps://doi.org/10.1145/2261250.2261270openalex-snapshot
Tracing compressed curves in triangulated surfaces
inferred← citeshttps://doi.org/10.1145/276884.276927openalex-snapshot
Constructing approximate shortest path maps in three dimensions
inferred← citeshttps://doi.org/10.14288/1.0051298openalex-snapshot
Terrain drainage features and queries
inferred← citeshttps://doi.org/10.29007/65hnopenalex-snapshot
Constant Storage for Storing Shortest Paths for a Polyhedron
inferred← citeshttps://doi.org/10.4224/16931693openalex-snapshot
Geodesic Paths On 3D Surfaces: Survey and Open Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02229openalex-snapshot
Searching edges in the overlap of two plane graphs
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.