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.
Recommendations
- Systolic algorithms for rectilinear polygons
- scientific article; zbMATH DE number 4037201
- scientific article; zbMATH DE number 4092772
- Computational geometry algorithms for the systolic screen
- scientific article; zbMATH DE number 795220
- scientific article; zbMATH DE number 3974322
- scientific article; zbMATH DE number 4139323
- Algorithmic geometry. Foundations, methods, applications
- scientific article; zbMATH DE number 66476
- Editorial
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3894498 (Why is no real title available?)
- On Bounded Database Schemes and Bounded Horn-Clause Programs
- Parallel Image Processing by Memory-Augmented Cellular Automata
- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
- Systolic algorithms for rectilinear polygons
Cited in
(4)
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)