VLSI systems for some problems of computational geometry
✍ Scribed by Ondrej Sýkora
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 333 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
✦ Synopsis
Fast solution of the computational geometry problems is important for computer graphics, image processing and pattern recognition, The capability of the network Mesh of Trees for application in VLSI systems solving fastly the computational geometry problems is shown on two examples: determination of the convex hull of a weakly externally visible polygon and determination of the visibility polygon of a polygon.
📜 SIMILAR VOLUMES
## Computation of Orientational Filters for Real-time Computer Vision Problems III: Steerable System and VLSI Architecture rientational filters have been used frequently for computer vision problems. Despite their strength in various vision problems, their use has been limited in real-time applica