Solving visibility and separability problems on a mesh-of-processors
From MaRDI portal
Publication:1104081
DOI10.1007/BF01901193zbMATH Open0646.68053MaRDI QIDQ1104081FDOQ1104081
Authors: Frank Dehne 
Publication date: 1988
Published in: The Visual Computer (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4050999
- Graph Problems on a Mesh-Connected Processor Array
- Parallelizing an Algorithm for Visibility on Polyhedral Terrain
- Visibility masks for solving complex radiosity computations on multiprocessors
- Parallel methods for visibility and shortest-path problems in simple polygons
- A framework for \(n\)-dimensional visibility computations
- Solving tree problems on a mesh-connected processor array
- scientific article; zbMATH DE number 4030966
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)
Cites Work
- A linear algorithm for computing the visibility polygon from a point
- Visibility of a simple polygon
- Sorting on a mesh-connected parallel computer
- Translation separability of sets of polygons
- Title not available (Why is that?)
- An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line Problem
- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
- Computational geometry algorithms for the systolic screen
- Constant-time convexity problems on reconfigurable meshes
- Solving visibility problems on MCCs of smaller size
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Solving visibility and separability problems on a mesh-of-processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104081)
