Systolic algorithms for computational geometry problems - a survey (Q1121668)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4104375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Systolic algorithms for computational geometry problems - a survey |
scientific article; zbMATH DE number 4104375 |
Statements
Systolic algorithms for computational geometry problems - a survey (English)
0 references
1989
0 references
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.
0 references
systolic array
0 references
computational geometry
0 references
systolic algorithms
0 references
convex hulls
0 references
intersection
0 references
visibility
0 references
proximity
0 references
geometric search
0 references
0 references
0.9137228
0 references
0.88874424
0 references
0.87250334
0 references
