On the public citation graph
An optimal parallel algorithm for triangulating a set of points in the plane
0 signed · 23 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/nme.1620080402openalex-snapshot
Automatic triangulation of arbitrary planar domains for the finite element method
inferredcites →https://doi.org/10.1007/bf01414463openalex-snapshot
An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
inferredcites →https://doi.org/10.1109/sfcs.1985.65openalex-snapshot
Visibility-polygon search and euclidean shortest paths
inferredcites →https://doi.org/10.1109/tc.1980.1675628openalex-snapshot
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
inferredcites →https://doi.org/10.1145/10515.10539openalex-snapshot
Efficient plane sweeping in parallel
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.1145/800220.806703openalex-snapshot
On parallel searching (Extended Abstract)
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.1503openalex-snapshot
Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_104openalex-snapshot
A survey of parallel computational geometry algorithms
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_41openalex-snapshot
Parallel general prefix computations with geometric, algebraic and other applications
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_22openalex-snapshot
Weighted parallel triangulation of simple polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_21openalex-snapshot
A Parallel Approximation Algorithm for Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1007/bf01381719openalex-snapshot
Parallel general prefix computations with geometric, algebraic, and other applications
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90032-1openalex-snapshot
Triangulating a polygon in parallel
inferred← citeshttps://doi.org/10.1023/a:1009740712769openalex-snapshot
Parallel Processing for Terrain Analysis in GIS: Visibility as a Case Study
inferred← citeshttps://doi.org/10.1109/71.363412openalex-snapshot
Efficient geometric algorithms on the EREW PRAM
inferred← citeshttps://doi.org/10.1109/ipps.1991.153750openalex-snapshot
Triangulation in a plane and 3D convex hull on mesh-connected arrays and hypercubes
inferred← citeshttps://doi.org/10.1109/spdp.1991.218293openalex-snapshot
Parallel algorithms that solve problems by communication
inferred← citeshttps://doi.org/10.1145/10515.10539openalex-snapshot
Efficient plane sweeping in parallel
inferred← citeshttps://doi.org/10.7282/t3mk6hg9openalex-snapshot
Parallel Triangulation of a Set of Points for Coarse Grained Multicomputers
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.