On the public citation graph

Parallel triangulation of a polygon in two calls to the trapezoidal map

0 signed · 42 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.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.1137/0217010openalex-snapshot

An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

inferredcites →https://doi.org/10.1145/10515.10539openalex-snapshot

Efficient plane sweeping in parallel

inferredcites →https://doi.org/10.1145/12130.12170openalex-snapshot

A linear-time algorithm for triangulating simple polygons

inferredcites →https://doi.org/10.1145/357337.357340openalex-snapshot

Triangulation and shape-complexity

inferredcites →https://doi.org/10.1145/357337.357341openalex-snapshot

Triangulating Simple Polygons and Equivalent Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1527openalex-snapshot

Coarse-Grained Parallel Geometric Search

inferred← citeshttps://doi.org/10.1007/3-540-52292-1_23openalex-snapshot

Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry

inferred← citeshttps://doi.org/10.1007/3-540-56402-0_38openalex-snapshot

Parallel triangulation of nonconvex polytopes

inferred← citeshttps://doi.org/10.1007/3-540-58715-2_125openalex-snapshot

Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems

inferred← citeshttps://doi.org/10.1007/bf01758749openalex-snapshot

Optimal parallel algorithms for point-set and polygon problems

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/bf01941686openalex-snapshot

Optimal Cooperative Search in Fractional Cascaded Data Structures

inferred← citeshttps://doi.org/10.1016/0020-0190(93)90080-sopenalex-snapshot

Testing a simple polygon for monotonicity optimally in parallel

inferred← citeshttps://doi.org/10.1016/0743-7315(90)90135-copenalex-snapshot

Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry

inferred← citeshttps://doi.org/10.1016/0925-7721(94)00023-9openalex-snapshot

On the multisearching problem for hypercubes

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/50019-xopenalex-snapshot

Parallel Computational Geometry: An Approach using Randomization

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00212-5openalex-snapshot

Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems

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/71.363412openalex-snapshot

Efficient geometric algorithms on the EREW PRAM

inferred← citeshttps://doi.org/10.1109/icra.2012.6224694openalex-snapshot

Navigation among visually connected sets of partially distinguishable landmarks

inferred← citeshttps://doi.org/10.1109/ipps.1993.262818openalex-snapshot

Parallel analog algorithms for processing polygonal images on a systolic screen

inferred← citeshttps://doi.org/10.1109/ipps.1993.262878openalex-snapshot

Optimal mesh computer algorithms for simple polygons

inferred← citeshttps://doi.org/10.1109/ipps.1993.262900openalex-snapshot

Testing a simple polygon for monotonicity optimally in parallel

inferred← citeshttps://doi.org/10.1109/ipps.1997.580919openalex-snapshot

Coarse grained parallel next element search

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.1109/spdp.1994.346129openalex-snapshot

An optimal hypercube algorithm for the all nearest smaller values problem

inferred← citeshttps://doi.org/10.1137/0218035openalex-snapshot

Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms

inferred← citeshttps://doi.org/10.1137/0220045openalex-snapshot

Parallel Transitive Closure and Point Location in Planar Structures

inferred← citeshttps://doi.org/10.1137/s0097539790184298openalex-snapshot

Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications

inferred← citeshttps://doi.org/10.1142/s021819599800014xopenalex-snapshot

Determining Weak Visibility of a Polygon from an Edge in Parallel

inferred← citeshttps://doi.org/10.1142/s0218195999000030openalex-snapshot

AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS

inferred← citeshttps://doi.org/10.1145/129712.129762openalex-snapshot

Planar separators and parallel polygon triangulation (preliminary version)

inferred← citeshttps://doi.org/10.1145/142675.142692openalex-snapshot

An optimal parallel algorithm for detecting weak visibility of a simple polygon

inferred← citeshttps://doi.org/10.1145/160985.161002openalex-snapshot

Geometric partitioning made easier, even in parallel

inferred← citeshttps://doi.org/10.1145/336154.336206openalex-snapshot

Linear-time triangulation of a simple polygon made easier via randomization

inferred← citeshttps://doi.org/10.1145/97444.97698openalex-snapshot

Optimal cooperative search in fractional cascaded data structures

inferred← citeshttps://doi.org/10.1145/97444.97700openalex-snapshot

Randomized algorithms for binary search and load balancing with geometric applications

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.