Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region

DOI10.1016/0167-8191(88)90085-3zbMath0657.68041OpenAlexW1964144007MaRDI QIDQ1111022

S. H. Smith

Publication date: 1988

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90085-3

zbMATH Keywords

triangulationcomputational geometryCADvisibility polygonone- dimensional systolic array

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Cellular automata (computational aspects) (68Q80) Other problems of combinatorial convexity (52A37) Theory of operating systems (68N25)

Related Items (3)

Solving visibility and separability problems on a mesh-of-processors ⋮ Systolic algorithms for computational geometry problems - a survey ⋮ On colourability of polygon visibility graphs

This page was built for publication: Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region