Short communication: VLSI systems for some problems of computational geometry

Authors:
Ondrej Sýkora
Affiliations:
-
Venue:
Parallel Computing
Year:
1984

Citing 3
Cited 0

A layout strategy for VLSI which is provably good (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A complexity theory for VLSI

A complexity theory for VLSI
Measuring Concavity on a Rectangular Mosaic

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.