On the public citation graph

Computational geometry algorithms for the systolic screen

https://doi.org/10.1007/bf01759069
0 signed · 55 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.1007/3-540-17943-7_124openalex-snapshot
Computing on a systolic screen: Hulls, contours and applications
inferredcites →https://doi.org/10.1007/3-540-50728-0_44openalex-snapshot
Separating a polyhedron by one translation from a set of obstacles
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf00264437openalex-snapshot
A longest common subsequence algorithm suitable for similar text strings
inferredcites →https://doi.org/10.1007/bf01762120openalex-snapshot
Parallel computational geometry
inferredcites →https://doi.org/10.1007/bf01890986openalex-snapshot
Optical clustering
inferredcites →https://doi.org/10.1007/bf01901192openalex-snapshot
Recognizing polygons, or how to spy
inferredcites →https://doi.org/10.1007/bf01901193openalex-snapshot
Solving visibility and separability problems on a mesh-of-processors
inferredcites →https://doi.org/10.1007/bf01952829openalex-snapshot
Translation separability of sets of polygons
inferredcites →https://doi.org/10.1007/bfb0028984openalex-snapshot
Parallel computation of discrete Voronoi diagrams
inferredcites →https://doi.org/10.1016/0020-0190(85)90058-4openalex-snapshot
A systolic array for the longest common subsequence problem
inferredcites →https://doi.org/10.1016/0020-0190(86)90070-0openalex-snapshot
algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0031-3203(73)90045-9openalex-snapshot
A cellular logic array for image processing
inferredcites →https://doi.org/10.1016/0167-8191(89)90055-0openalex-snapshot
Computing the configuration space for a robot on a mesh-of-processors
inferredcites →https://doi.org/10.1016/0734-189x(84)90049-5openalex-snapshot
Parallel computer architectures for image processing
inferredcites →https://doi.org/10.1016/0743-7315(90)90112-3openalex-snapshot
Computing the largest empty rectangle on One- and two-dimensional processor arrays
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50020-7openalex-snapshot
An Isothetic View of Computational Geometry
inferredcites →https://doi.org/10.1016/s0065-2458(08)60034-0openalex-snapshot
Clustering Methodologies in Exploratory Data Analysis
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1080/00029890.1979.11994873openalex-snapshot
Digital Topology
inferredcites →https://doi.org/10.1109/jrproc.1958.286755openalex-snapshot
A Computer Oriented toward Spatial Problems
inferredcites →https://doi.org/10.1109/mc.1983.1654162openalex-snapshot
Parallel Image Processing Using Cellular Arrays
inferredcites →https://doi.org/10.1109/mcse.2024.3483469openalex-snapshot
IEEE Transactions on Computers
inferredcites →https://doi.org/10.1109/pgec.1963.263561openalex-snapshot
A Multilayer Iterative Circuit Computer
inferredcites →https://doi.org/10.1109/pgec.1963.263562openalex-snapshot
The Illinois Pattern Recognition Computer-ILLIAC III
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1109/sfcs.1983.75openalex-snapshot
The power of geometric duality
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1109/tpami.1984.4767531openalex-snapshot
Digital Disks
inferredcites →https://doi.org/10.1109/tpami.1985.4767645openalex-snapshot
Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer
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/1457769.1457836openalex-snapshot
A computer oriented toward spatial problems
inferredcites →https://doi.org/10.1145/321574.321588openalex-snapshot
On Limit Properties in Digitization Schemes
inferredcites →https://doi.org/10.1145/322033.322044openalex-snapshot
Algorithms for the Longest Common Subsequence Problem
inferredcites →https://doi.org/10.1145/323233.323245openalex-snapshot
The direct dominance problem
inferredcites →https://doi.org/10.1145/323233.323264openalex-snapshot
Voronoi diagrams based on convex distance functions
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1145/359581.359603openalex-snapshot
A fast algorithm for computing longest common subsequences
inferredcites →https://doi.org/10.1145/41958.41989openalex-snapshot
Variations on visibility
inferredcites →https://doi.org/10.1145/828.322449openalex-snapshot
Graph Problems on a Mesh-Connected Processor Array
inferredcites →https://doi.org/10.1214/aoms/1177692459openalex-snapshot
The 1972 Wald Lecture Robust Statistics: A Review
inferredcites →https://doi.org/10.82308/4930openalex-snapshot
Rectilinear computational geometry

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20246openalex-snapshot
Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
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.1016/1049-9660(92)90032-xopenalex-snapshot
Image analysis and computer vision: 1991
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.jmaa.2007.03.027openalex-snapshot
A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
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.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/eit57321.2023.10187239openalex-snapshot
Calculating an Approximate Voronoi Diagram using QuadTrees and Triangles
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.1504/ijbic.2012.047239openalex-snapshot
Slime mould computes planar shapes
inferred← citeshttps://doi.org/10.48550/arxiv.1106.0305openalex-snapshot
Slime mould computes planar shapes
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.