On the public citation graph
Parallel methods for visibility and shortest-path problems in simple polygons
0 signed · 73 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.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf01759076openalex-snapshot
Deterministic parallel list ranking
inferredcites →https://doi.org/10.1007/bf01762118openalex-snapshot
Parallel triangulation of a polygon in two calls to the trapezoidal map
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf01901194openalex-snapshot
Parallel algorithms for shortest path problems in polygons
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1007/bfb0040377openalex-snapshot
Optimal parallel algorithms for expression tree evaluation and list ranking
inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0022-0000(89)90041-xopenalex-snapshot
Optimal shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(89)90045-7openalex-snapshot
Computing geodesic furthest neighbors in simple polygons
inferredcites →https://doi.org/10.1016/0166-218x(91)90063-3openalex-snapshot
Computing external farthest neighbors for a simple polygon
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(81)90019-5openalex-snapshot
A linear algorithm for computing the visibility polygon from a point
inferredcites →https://doi.org/10.1016/0196-6774(89)90017-5openalex-snapshot
A simple parallel tree contraction algorithm
inferredcites →https://doi.org/10.1016/0196-6774(89)90032-1openalex-snapshot
Triangulating a polygon in parallel
inferredcites →https://doi.org/10.1016/0196-6774(92)90046-fopenalex-snapshot
An efficient parallel algorithm for the row minima of a totally monotone matrix
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/0743-7315(86)90011-0openalex-snapshot
Efficient parallel solutions to some geometric problems
inferredcites →https://doi.org/10.1016/0743-7315(90)90103-vopenalex-snapshot
An optimal parallel algorithm for building a data structure for planar point location
inferredcites →https://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
inferredcites →https://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1109/sfcs.1986.10openalex-snapshot
Approximate and exact parallel scheduling with applications to list, tree and graph problems
inferredcites →https://doi.org/10.1109/sfcs.1988.21966openalex-snapshot
Notes on searching in multidimensional monotone arrays
inferredcites →https://doi.org/10.1109/tc.1981.1675729openalex-snapshot
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0218014openalex-snapshot
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
inferredcites →https://doi.org/10.1137/0218035openalex-snapshot
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
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/41958.41960openalex-snapshot
Finding the visibility graph of a simple polygon in time proportional to its size
inferredcites →https://doi.org/10.1145/72935.72950openalex-snapshot
Intersecting line segments in parallel with an output-sensitive number of processors
inferredcites →https://doi.org/10.1145/72935.72978openalex-snapshot
Optimal parallel algorithms for transitive closure and point location in planar structures
inferredcites →https://doi.org/10.1145/73833.73846openalex-snapshot
Optimal parallel algorithm for visibility of a simple polygon from a point
inferredcites →https://doi.org/10.1145/800057.808674openalex-snapshot
Intersecting is easier than sorting
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.1002/scj.4690240101openalex-snapshot
An optimal parallel algorithm for finding shortest paths inside simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_255openalex-snapshot
Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_30openalex-snapshot
Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_64openalex-snapshot
On parallel complexity of planar triangulations
inferred← citeshttps://doi.org/10.1007/bf01187038openalex-snapshot
An addendum to parallel methods for visibility and shortest-path problems in simple polygons
inferred← citeshttps://doi.org/10.1007/bf01206332openalex-snapshot
Optimal parallel algorithms for rectilinear link-distance problems
inferred← citeshttps://doi.org/10.1007/bf01293668openalex-snapshot
Finding a closest visible vertex pair between two polygons
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/j.robot.2005.03.003openalex-snapshot
VLSI-efficient schemes for high-speed construction of tangent graph
inferred← citeshttps://doi.org/10.1023/a:1013949515552openalex-snapshot
High-Speed Environment Representation Scheme for Dynamic Path Planning
inferred← citeshttps://doi.org/10.1023/a:1020292101435openalex-snapshot
Environment Modelling for Robot Navigation Using VLSI-Efficient Logarithmic Approximation Method
inferred← citeshttps://doi.org/10.1080/01495739808947366openalex-snapshot
OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*
inferred← citeshttps://doi.org/10.1080/10637199308915433openalex-snapshot
OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
inferred← citeshttps://doi.org/10.1109/ipps.1993.262878openalex-snapshot
Optimal mesh computer algorithms for simple polygons
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/109648.109665openalex-snapshot
Randomized parallel algorithms for trapezoidal diagrams
inferred← citeshttps://doi.org/10.1145/113379.113395openalex-snapshot
Constructing arrangements optimally in parallel (preliminary version)
inferred← citeshttps://doi.org/10.1145/129712.129762openalex-snapshot
Planar separators and parallel polygon triangulation (preliminary version)
inferred← citeshttps://doi.org/10.1145/142675.142687openalex-snapshot
Optimal parallel algorithms for triangulated simple polygons
inferred← citeshttps://doi.org/10.1145/225058.225285openalex-snapshot
Computing faces in segment and simplex arrangements
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.