On the public citation graph

Parallel algorithms for shortest path problems in polygons

https://doi.org/10.1007/bf01901194
0 signed · 37 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.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01762120openalex-snapshot
Parallel computational geometry
inferredcites →https://doi.org/10.1007/bf01762130openalex-snapshot
Parallel algorithms for some functions of two convex polygons
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
inferredcites →https://doi.org/10.1016/0743-7315(86)90011-0openalex-snapshot
Efficient parallel solutions to some geometric problems
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1109/sfcs.1985.42openalex-snapshot
Parallel computational geometry
inferredcites →https://doi.org/10.1109/sfcs.1987.12openalex-snapshot
Cascading divide-and-conquer: A technique for designing parallel algorithms
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1145/10515.10516openalex-snapshot
Linear time algorithms for visibility and shortest path problems inside simple polygons
inferredcites →https://doi.org/10.1145/12130.12170openalex-snapshot
A linear-time algorithm for triangulating simple polygons
inferredcites →https://doi.org/10.1145/22145.22161openalex-snapshot
Efficient parallel solution of linear systems
inferredcites →https://doi.org/10.1145/2514.2515openalex-snapshot
Parallel graph algorithms
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.82308/18310openalex-snapshot
Hierarchical decomposition of polygons with applications

What points at this work

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

inferred← citeshttps://doi.org/10.1002/scj.4690240101openalex-snapshot
An optimal parallel algorithm for finding shortest paths inside simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_64openalex-snapshot
On parallel complexity of planar triangulations
inferred← citeshttps://doi.org/10.1007/bf01758856openalex-snapshot
Parallel methods for visibility and shortest-path problems in simple polygons
inferred← citeshttps://doi.org/10.1007/bf02570717openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90032-1openalex-snapshot
Triangulating a polygon in parallel
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90002-vopenalex-snapshot
Parallel rectilinear shortest paths with rectangular obstacles
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1080/01495739808947366openalex-snapshot
OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/ipps.1993.262878openalex-snapshot
Optimal mesh computer algorithms for simple polygons
inferred← citeshttps://doi.org/10.1109/sfcs.1987.12openalex-snapshot
Cascading divide-and-conquer: A technique for designing parallel algorithms
inferred← citeshttps://doi.org/10.1137/0218035openalex-snapshot
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
inferred← citeshttps://doi.org/10.1142/s021819599800014xopenalex-snapshot
Determining Weak Visibility of a Polygon from an Edge in Parallel
inferred← citeshttps://doi.org/10.1145/177424.178040openalex-snapshot
Efficient piecewise-linear function approximation using the uniform metric
inferred← citeshttps://doi.org/10.1145/195613.195617openalex-snapshot
Parallel algorithms for evaluating sequences of set-manipulation operations
inferred← citeshttps://doi.org/10.1145/97444.97694openalex-snapshot
Parallel rectilinear shortest paths with rectangular obstacles
inferred← citeshttps://doi.org/10.1145/98524.98539openalex-snapshot
Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
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.