On the public citation graph
Parallel geometric algorithms on a mesh-connected computer
0 signed · 64 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.1016/0020-0190(79)90074-7openalex-snapshot
Voronoi diagrams from convex hulls
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/12.21120openalex-snapshot
Mesh computer algorithms for computational geometry
inferredcites →https://doi.org/10.1109/tc.1979.1675216openalex-snapshot
Bitonic Sort on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1109/tc.1981.1675791openalex-snapshot
A Self-Routing Benes Network and Parallel Permutation Algorithms
inferredcites →https://doi.org/10.1109/tc.1981.6312172openalex-snapshot
Data broadcasting in SIMD computers
inferredcites →https://doi.org/10.1109/tc.1983.1676217openalex-snapshot
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
inferredcites →https://doi.org/10.1137/0209058openalex-snapshot
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1145/10515.10539openalex-snapshot
Efficient plane sweeping in parallel
inferredcites →https://doi.org/10.1145/322169.322172openalex-snapshot
An optimal routing algorithm for mesh-connected Parallel computers
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1145/800057.808674openalex-snapshot
Intersecting is easier than sorting
inferredcites →https://doi.org/10.1145/828.322449openalex-snapshot
Graph Problems on a Mesh-Connected Processor Array
inferredcites →https://doi.org/10.5555/42040.42099openalex-snapshot
Parallel geometric algorithms on mesh-connected computers
inferredcites →https://doi.org/10.6084/m9.figshare.13645706openalex-snapshot
Constructing the Voronoi Diagram on a Mesh-Connected Computer
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.1994.1001openalex-snapshot
Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1051openalex-snapshot
Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_6openalex-snapshot
Parallel Edge Coloring of a Tree on a Mesh Connected Computer
inferred← citeshttps://doi.org/10.1007/bf01758844openalex-snapshot
On the parallel-decomposability of geometric problems
inferred← citeshttps://doi.org/10.1016/0010-4485(91)90087-dopenalex-snapshot
Parallel implementation of 3D convex-hull algorithm
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90081-hopenalex-snapshot
Parallel enclosing rectangle on SIMD machines
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90022-dopenalex-snapshot
Parallel computation of the Hausdorff distance between images
inferred← citeshttps://doi.org/10.1016/0167-8655(91)90003-5openalex-snapshot
On the recognition of digital planes in three-dimensional space
inferred← citeshttps://doi.org/10.1016/0895-7177(96)00003-9openalex-snapshot
Voronoi-like partition of lattice in cellular automata
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/1049-9660(91)90020-popenalex-snapshot
Image analysis and computer vision: 1990
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2019.03.012openalex-snapshot
Approximation of Voronoï cell attributes using parallel solution
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80109-7openalex-snapshot
Parallel voronoi diagram in L1 (L∞) metric on a mesh-connected computer
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80152-8openalex-snapshot
An improved parallel algorithm for constructing voronoi diagram on a mesh-connected computer
inferred← citeshttps://doi.org/10.1016/s0895-7177(97)00145-3openalex-snapshot
Fine-grain discrete Voronoi diagram algorithms in L1 and L∞ norms
inferred← citeshttps://doi.org/10.1016/s0898-1221(97)90055-9openalex-snapshot
Parallel algorithms for regular architectures: Meshes and pyramids
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/10637199308915435openalex-snapshot
AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗
inferred← citeshttps://doi.org/10.1080/10637199508915473openalex-snapshot
AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER
inferred← citeshttps://doi.org/10.1109/12.21120openalex-snapshot
Mesh computer algorithms for computational geometry
inferred← citeshttps://doi.org/10.1109/12.9737openalex-snapshot
Efficient parallel convex hull algorithms
inferred← citeshttps://doi.org/10.1109/34.21793openalex-snapshot
Algorithmic techniques for computer vision on a fine-grained parallel machine
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/71.954618openalex-snapshot
Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications
inferred← citeshttps://doi.org/10.1109/fmpc.1988.47467openalex-snapshot
Applied geometric algorithms on Boolean N-cube computers
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89429openalex-snapshot
Asymptotically efficient hypercube algorithms for computational geometry
inferred← citeshttps://doi.org/10.1109/ftdcs.1993.344158openalex-snapshot
Parallel programming on reconfigurable meshes with buses
inferred← citeshttps://doi.org/10.1109/icapp.1995.472216openalex-snapshot
An L/sub 1/ Voronoi diagram algorithm for a reconfigurable mesh
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/ipps.1992.223058openalex-snapshot
An optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer (for rectangle read triangle)
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.262882openalex-snapshot
A parallel MSF algorithm for planar graphs on a mesh and applications to image processing
inferred← citeshttps://doi.org/10.1109/ipps.1994.288190openalex-snapshot
An optimal mesh computer algorithm for constrained Delaunay triangulation
inferred← citeshttps://doi.org/10.1109/ipps.1994.288296openalex-snapshot
An optimal parallel matching algorithm for a convex bipartite graph on a mesh-connected computer
inferred← citeshttps://doi.org/10.1109/ipps.1994.288315openalex-snapshot
Computational geometry on a reconfigurable mesh
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/spdp.1990.143619openalex-snapshot
An improved parallel algorithm for construction Voronoi diagram on a mesh-connected computer
inferred← citeshttps://doi.org/10.1109/spdp.1993.395531openalex-snapshot
Parallel algorithms for geometric problems on networks of processors
inferred← citeshttps://doi.org/10.1109/spdp.1996.570360openalex-snapshot
A unifying methodology for multiple querying on enhanced meshes
inferred← citeshttps://doi.org/10.1145/73833.73845openalex-snapshot
On the parallel decomposability of geometric problems
inferred← citeshttps://doi.org/10.1349/ddlp.1799openalex-snapshot
Efficient parallel algorithms for closest point problems.
inferred← citeshttps://doi.org/10.22215/etd/2006-08509openalex-snapshot
Parallel Voronoi diagrams for VLSI design
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.