Solving visibility and separability problems on a mesh-of-processors
type: Item
instance of: scholarly article
title: Solving visibility and separability problems on a mesh-of-processors
zbMATH Open document ID: 0646.68053
DOI: 10.1007/BF01901193
author: Frank Dehne
published in: The Visual Computer
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 4055039
zbMATH Keywords: computational geometry
zbMATH Keywords: separability
zbMATH Keywords: parallel algorithms
zbMATH Keywords: mesh-of- processors
zbMATH Keywords: visibility
MaRDI profile type: Publication
cites work: Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
cites work: Q3217599
cites work: Q3745337
cites work: Translation separability of sets of polygons
cites work: An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line'' Problem
cites work: A linear algorithm for computing the visibility polygon from a point
cites work: Visibility of a simple polygon
cites work: Q3683086
cites work: Sorting on a mesh-connected parallel computer
Recommended article: Q3787488
Recommended article: Graph Problems on a Mesh-Connected Processor Array
Recommended article: Parallelizing an Algorithm for Visibility on Polyhedral Terrain
Recommended article: Visibility masks for solving complex radiosity computations on multiprocessors
Recommended article: Parallel methods for visibility and shortest-path problems in simple polygons
Recommended article: A Framework for n-Dimensional Visibility Computations
Recommended article: Solving tree problems on a mesh-connected processor array
Recommended article: Q3771605
description: scientific article; zbMATH DE number 4055039