On the public citation graph
Optimal parallel algorithms for point-set and polygon problems
0 signed · 56 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/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
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/bf01762130openalex-snapshot
Parallel algorithms for some functions of two convex polygons
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)90066-2openalex-snapshot
The all nearest-neighbor problem for convex polygons
inferredcites →https://doi.org/10.1016/0020-0190(79)90021-8openalex-snapshot
A note on the all nearest-neighbor problem for convex polygons
inferredcites →https://doi.org/10.1016/0020-0190(87)90002-0openalex-snapshot
Finding the convex hull of a sorted point set in parallel
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(89)90032-1openalex-snapshot
Triangulating a polygon in parallel
inferredcites →https://doi.org/10.1016/0304-3975(79)90055-0openalex-snapshot
Finding the intersection of n half-spaces in time O(n log n)
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.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
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.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.1145/322139.322142openalex-snapshot
An Optimal Algorithm for Finding the Kernel of a Polygon
inferredcites →https://doi.org/10.1145/800113.803652openalex-snapshot
Divide-and-conquer in multidimensional space
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.1006/jpdc.1996.0095openalex-snapshot
Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_96openalex-snapshot
Time-optimal nearest-neighbor computations on enhanced meshes
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_714openalex-snapshot
Parallel randomized techniques for some fundamental geometric problems: A survey
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_7openalex-snapshot
Parallel Randomized Techniques for Some Fundamental Geometric Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39958-9_39openalex-snapshot
The Unified Algorithmic Platform for Solving Complex Problems of Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-40164-0_21openalex-snapshot
New Sequential and Parallel Algorithms for Computing the β-Spectrum
inferred← citeshttps://doi.org/10.1007/978-3-658-37711-3_4openalex-snapshot
Durchschnitte, Zerlegungen und Sichtbarkeit
inferred← citeshttps://doi.org/10.1007/bfb0045071openalex-snapshot
Constructing a strongly convex superhull of points
inferred← citeshttps://doi.org/10.1007/s10559-010-9196-zopenalex-snapshot
Recursion and parallel algorithms in geometric modeling problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.033openalex-snapshot
New sequential and parallel algorithms for computing the β-spectrum
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80023-6openalex-snapshot
Parallel solutions to geometric problems in the scan model of computation
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00105-7openalex-snapshot
Fundamental data movement operations and its applications on a hyper-bus broadcast network
inferred← citeshttps://doi.org/10.1109/12.392849openalex-snapshot
Optimal parallel hypercube algorithms for polygon problems
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/71.615443openalex-snapshot
An optimal algorithm for the angle-restricted all nearest neighbor problem on the reconfigurable mesh, with applications
inferred← citeshttps://doi.org/10.1109/hicss.1994.323267openalex-snapshot
Maintaining Voronoi diagrams in parallel
inferred← citeshttps://doi.org/10.1109/icapp.1995.472195openalex-snapshot
A parallel method for finding the convex hull of discs
inferred← citeshttps://doi.org/10.1109/ipps.1994.288314openalex-snapshot
Time-optimal proximity algorithms on meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1137/1.9781611976465.128openalex-snapshot
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model
inferred← citeshttps://doi.org/10.1142/9789812797773_0002openalex-snapshot
COMPETITIVE STRATEGIES FOR AUTONOMOUS SYSTEMS
inferred← citeshttps://doi.org/10.1142/s0218195901000614openalex-snapshot
CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
inferred← citeshttps://doi.org/10.1142/s0218195998000151openalex-snapshot
Finding the Convex Hull of Discs in Parallel
inferred← citeshttps://doi.org/10.1142/s0218195999000091openalex-snapshot
COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
inferred← citeshttps://doi.org/10.1145/160985.161002openalex-snapshot
Geometric partitioning made easier, even in parallel
inferred← citeshttps://doi.org/10.1145/177424.177511openalex-snapshot
Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems
inferred← citeshttps://doi.org/10.1145/1868013.1868030openalex-snapshot
The system of common algorithmic space to create visual models of phenomena and processes
inferred← citeshttps://doi.org/10.1145/200836.200853openalex-snapshot
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
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.