On the public citation graph
Time-optimal visibility-related algorithms on meshes with multiple broadcasting
0 signed · 62 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/(sici)1520-6378(199702)22:1<65::aid-col11>3.0.co;2-7openalex-snapshot
Computer graphics: Principles and practice
inferredcites →https://doi.org/10.1006/jpdc.1994.1074openalex-snapshot
A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications
inferredcites →https://doi.org/10.1006/jpdc.1996.1244openalex-snapshot
Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package
inferredcites →https://doi.org/10.1007/3-540-54029-6_180openalex-snapshot
An optimal parallel algorithm for the vertical segment visibility reporting problem
inferredcites →https://doi.org/10.1007/3-540-56891-3_45openalex-snapshot
A unifying look at semigroup computations on meshes with multiple broadcasting
inferredcites →https://doi.org/10.1007/3-540-58184-7_96openalex-snapshot
Time-optimal nearest-neighbor computations on enhanced meshes
inferredcites →https://doi.org/10.1007/bf01990523openalex-snapshot
Optimal convex hull algorithms on enhanced meshes
inferredcites →https://doi.org/10.1016/0012-365x(87)90190-7openalex-snapshot
A note on visibility graphs
inferredcites →https://doi.org/10.1016/0020-0190(87)90091-3openalex-snapshot
Obstacle growing in a nonpolygonal world
inferredcites →https://doi.org/10.1016/0020-0190(87)90093-7openalex-snapshot
An O(log n) time parallel algorithm for triangulating a set of points in the plane
inferredcites →https://doi.org/10.1016/0097-8493(92)90053-xopenalex-snapshot
Computer graphics principles and practice, second edition
inferredcites →https://doi.org/10.1016/0141-9331(89)90038-0openalex-snapshot
High-performance computer architecture
inferredcites →https://doi.org/10.1016/0743-7315(87)90003-7openalex-snapshot
Array processor with multiple broadcasting
inferredcites →https://doi.org/10.1016/0743-7315(89)90022-1openalex-snapshot
Connection autonomy in SIMD computers: A VLSI implementation
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1109/12.73589openalex-snapshot
Square meshes are not always optimal
inferredcites →https://doi.org/10.1109/21.17370openalex-snapshot
Bus automata, brains, and mental models
inferredcites →https://doi.org/10.1109/34.42857openalex-snapshot
Image computations on meshes with multiple broadcast
inferredcites →https://doi.org/10.1109/71.296326openalex-snapshot
A fast selection algorithm for meshes with multiple broadcasting
inferredcites →https://doi.org/10.1109/71.506693openalex-snapshot
Square meshes are not optimal for convex hull computation
inferredcites →https://doi.org/10.1109/71.80135openalex-snapshot
Designing efficient parallel algorithms on mech-connected computers with multiple broadcasting
inferredcites →https://doi.org/10.1109/icpp.1993.168openalex-snapshot
Square Meshes are not Optimal for Convex Hull Computation
inferredcites →https://doi.org/10.1109/icpp.1993.180openalex-snapshot
Time- and VLSI-optimal Sorting on Meshes with Multiple Broadcasting
inferredcites →https://doi.org/10.1109/ipps.1994.288314openalex-snapshot
Time-optimal proximity algorithms on meshes with multiple broadcasting
inferredcites →https://doi.org/10.1109/tc.1980.1675684openalex-snapshot
Design of a Massively Parallel Processor
inferredcites →https://doi.org/10.1109/tc.1983.1676196openalex-snapshot
Spatial Planning: A Configuration Space Approach
inferredcites →https://doi.org/10.1109/tc.1984.1676405openalex-snapshot
Finding Maximum on an Array Processor with a Global Bus
inferredcites →https://doi.org/10.1109/tc.1986.1676685openalex-snapshot
A VLSI Solution to the Vertical Segment Visibility Problem
inferredcites →https://doi.org/10.1109/tcbb.2004.12openalex-snapshot
Sequencing-by-hybridization revisited: the analog-spectrum proposal
inferredcites →https://doi.org/10.1137/0215006openalex-snapshot
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
inferredcites →https://doi.org/10.1137/0218035openalex-snapshot
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
inferredcites →https://doi.org/10.1142/s0129626492000386openalex-snapshot
CONVEX POLYGON PROBLEMS ON MESHES WITH MULTIPLE BROADCASTING
inferredcites →https://doi.org/10.1142/s0129626493000095openalex-snapshot
SIMULATING ENHANCED MESHES, WITH APPLICATIONS
inferredcites →https://doi.org/10.2307/1573081openalex-snapshot
Pattern Classification and Scene Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470429983.ch19openalex-snapshot
Nanoscale Image Processing
inferred← citeshttps://doi.org/10.1002/pssa.200675309openalex-snapshot
A nano‐scale architecture for constant time image processing
inferred← citeshttps://doi.org/10.1006/cviu.1996.0041openalex-snapshot
Image Analysis and Computer Vision: 1995
inferred← citeshttps://doi.org/10.1006/gmip.1997.0440openalex-snapshot
Visibility Computation on Reconfigurable Meshes
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0095openalex-snapshot
Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1421openalex-snapshot
Time-Optimal Proximity Graph Computations on Enhanced Meshes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.07.005openalex-snapshot
Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting
inferred← citeshttps://doi.org/10.1023/a:1008234629602openalex-snapshot
Efficient Parallel Manipulations of IBB Coded Images on Meshes with Multiple Broadcasting
inferred← citeshttps://doi.org/10.1109/71.506693openalex-snapshot
Square meshes are not optimal for convex hull computation
inferred← citeshttps://doi.org/10.1109/71.569651openalex-snapshot
Time-optimal domain-specific querying on enhanced meshes
inferred← citeshttps://doi.org/10.1109/71.629485openalex-snapshot
Podality-based time-optimal computations on enhanced meshes
inferred← citeshttps://doi.org/10.1109/71.730522openalex-snapshot
Time- and VLSI-optimal sorting on enhanced meshes
inferred← citeshttps://doi.org/10.1109/71.735954openalex-snapshot
Constant-time algorithms for constrained triangulations on reconfigurable meshes
inferred← citeshttps://doi.org/10.1109/71.755826openalex-snapshot
The mesh with hybrid buses: an efficient parallel architecture for digital geometry
inferred← citeshttps://doi.org/10.1109/asap.1995.522904openalex-snapshot
Time-optimal ranking algorithms on sorted matrices
inferred← citeshttps://doi.org/10.1109/icpads.1997.652575openalex-snapshot
Dynamic load distribution on a mesh with a single bus
inferred← citeshttps://doi.org/10.1109/ipps.1994.288313openalex-snapshot
Time-optimal visibility-related algorithms of meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1109/ispan.1996.509024openalex-snapshot
A time-optimal solution to planar point location in ordered functional domains, with applications
inferred← citeshttps://doi.org/10.1109/spdp.1996.570360openalex-snapshot
A unifying methodology for multiple querying on enhanced meshes
inferred← citeshttps://doi.org/10.1142/s0219265904001064openalex-snapshot
THE MESH WITH BINARY TREE NETWORKS: AN ENHANCED MESH WITH LOW BUS-LOADING
inferred← citeshttps://doi.org/10.1145/1265949.1265951openalex-snapshot
The spin-wave nanoscale reconfigurable mesh and the labeling problem
inferred← citeshttps://doi.org/10.1155/1999/29035openalex-snapshot
Investigation of Various Mesh ArchitecturesWith Broadcast Buses for High‐Performance Computing
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.7190openalex-snapshot
Multiple Bus Networks for Binary -Tree Algorithms.
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.