Systolic algorithms for computational geometry problems - a survey

From MaRDI portal





Among various kinds of parallel algorithms and processors systolic ones seem to be rather practical in various aspects. The paper briefly discusses basic matters of systolic computational geometry such as data representation and basic geometric operations and then briefly surveys systolic algorithms for five categories of problems: convex hulls, intersection, visibility, proximity, geometric search. The paper includes a number of new results and open problems.











This page was built for publication: Systolic algorithms for computational geometry problems - a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121668)