Solving visibility and separability problems on a mesh-of-processors

DOI10.1007/BF01901193zbMath0646.68053MaRDI QIDQ1104081

Frank Dehne

Publication date: 1988

Published in: The Visual Computer (Search for Journal in Brave)

zbMATH Keywords

separabilityparallel algorithmsvisibilitycomputational geometrymesh-of- processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Computational geometry algorithms for the systolic screen

Cites Work

• Translation separability of sets of polygons
• Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
• Visibility of a simple polygon
• A linear algorithm for computing the visibility polygon from a point
• Sorting on a mesh-connected parallel computer
• An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving visibility and separability problems on a mesh-of-processors