On the public citation graph
Merging free trees in parallel for efficient voronoi diagram construction
0 signed · 58 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.1007/3-540-51542-9_3openalex-snapshot
Constructing the Voronoi diagram of a set of line segments in parallel
inferredcites →https://doi.org/10.1007/3-540-52055-4openalex-snapshot
Concrete and Abstract Voronoi Diagrams
inferredcites →https://doi.org/10.1007/3-540-52282-4_46openalex-snapshot
On the construction of abstract voronoi diagrams
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01762130openalex-snapshot
Parallel algorithms for some functions of two convex polygons
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf02574686openalex-snapshot
On the construction of abstract voronoi diagrams
inferredcites →https://doi.org/10.1007/bfb0040368openalex-snapshot
Parallel algorithms for evaluating sequences of set-manipulation operations
inferredcites →https://doi.org/10.1109/sfcs.1989.63478openalex-snapshot
Recursive *-tree parallel data-structure
inferredcites →https://doi.org/10.1109/tc.1983.1676138openalex-snapshot
Searching, Merging, and Sorting in Parallel Computation
inferredcites →https://doi.org/10.1137/0218035openalex-snapshot
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
inferredcites →https://doi.org/10.1145/41958.41980openalex-snapshot
Parallel processing for efficient subdivision search
inferredcites →https://doi.org/10.1145/73007.73045openalex-snapshot
Polling: a new randomized sampling technique for computational geometry
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.1006/jagm.1997.0892openalex-snapshot
Ultrafast Expected Time Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/11564621_29openalex-snapshot
Design and Multithreading Implementation of the Wave-Front Algorithm for Constructing Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_43openalex-snapshot
New parallel algorithms for convex hull and triangulation in 3-dimensional space
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_7openalex-snapshot
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_161openalex-snapshot
Hamiltonian abstract Voronoi diagrams in linear time
inferred← citeshttps://doi.org/10.1007/bf01188708openalex-snapshot
Constructing the Voronoi diagram of a set of line segments in parallel
inferred← citeshttps://doi.org/10.1007/bf01944352openalex-snapshot
A nearly optimal deterministic parallel Voronoi diagram algorithm
inferred← citeshttps://doi.org/10.1007/bfb0028576openalex-snapshot
Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi Diagram
inferred← citeshttps://doi.org/10.1007/pl00008262openalex-snapshot
Design and Implementation of a Practical Parallel Delaunay Algorithm
inferred← citeshttps://doi.org/10.1007/s00371-002-0173-zopenalex-snapshot
Optimistic parallel Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90029-6openalex-snapshot
An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
inferred← citeshttps://doi.org/10.1016/j.cad.2012.10.031openalex-snapshot
Parallel computing 2D Voronoi diagrams using untransformed sweepcircles
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00024-2openalex-snapshot
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/71.642948openalex-snapshot
A simple Voronoi diagram algorithm for a reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/fscs.1990.89535openalex-snapshot
A tree-partitioning technique with applications to expression evaluation and term matching
inferred← citeshttps://doi.org/10.1109/hicss.1993.284096openalex-snapshot
Improved parallel bucketing algorithms for proximity problems
inferred← citeshttps://doi.org/10.1109/hicss.1994.323267openalex-snapshot
Maintaining Voronoi diagrams in parallel
inferred← citeshttps://doi.org/10.1109/icpp.2006.5openalex-snapshot
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/ipps.1995.395948openalex-snapshot
A simple Voronoi diagram algorithm for a reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/sc.2000.10045openalex-snapshot
A PARALLEL DYNAMIC-MESH LAGRANGIAN METHOD FOR SIMULATION OF FLOWS WITH DYNAMIC INTERFACES
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185439openalex-snapshot
Using approximation algorithms to design parallel algorithms that may ignore processor allocation
inferred← citeshttps://doi.org/10.1111/cgf.14125openalex-snapshot
Robust Computation of 3D Apollonius Diagrams
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/140901.141924openalex-snapshot
An efficient expected time parallel algorithm for Voronoi construction
inferred← citeshttps://doi.org/10.1145/237218.237357openalex-snapshot
Developing a practical projection-based parallel Delaunay algorithm
inferred← citeshttps://doi.org/10.1145/258492.258516openalex-snapshot
Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm
inferred← citeshttps://doi.org/10.1349/ddlp.1799openalex-snapshot
Efficient parallel algorithms for closest point problems.
inferred← citeshttps://doi.org/10.21236/ada328005openalex-snapshot
Implementation and Evaluation of an Efficient 2D Parallel Delaunay Triangulation Algorithm,
inferred← citeshttps://doi.org/10.32657/10356/65864openalex-snapshot
Intrinsic computation of voronoi diagrams on surfaces and its application
inferred← citeshttps://doi.org/10.5194/isprs-annals-x-3-w1-2022-141-2022openalex-snapshot
A PARALLELED DELAUNAY TRIANGULATION ALGORITHM FOR PROCESSING LARGE LIDAR POINTS
inferred← citeshttps://doi.org/10.5555/127787.127860openalex-snapshot
Ultra-fast expected time parallel algorithms
inferred← citeshttps://doi.org/10.5555/370049.370394openalex-snapshot
A PARALLEL DYNAMIC-MESH LAGRANGIAN METHOD FOR SIMULATION OF FLOWS WITH DYNAMIC INTERFACES
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.