Systolic algorithms for computational geometry problems - a survey
From MaRDI portal
Publication:1121668
DOI10.1007/BF02238727zbMath0674.68020MaRDI QIDQ1121668
Publication date: 1989
Published in: Computing (Search for Journal in Brave)
proximity; visibility; computational geometry; systolic algorithms; convex hulls; systolic array; intersection; geometric search
68Q25: Analysis of algorithms and problem complexity
68U99: Computing methodologies and applications
65Y05: Parallel numerical computation
52A30: Variants of convex sets (star-shaped, ((m, n))-convex, etc.)
68W99: Algorithms in computer science