Solving visibility and separability problems on a mesh-of-processors
From MaRDI portal
(Redirected from Publication:1104081)
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
Cites work
- scientific article; zbMATH DE number 3883607 (Why is no real title available?)
- scientific article; zbMATH DE number 3905323 (Why is no real title available?)
- scientific article; zbMATH DE number 3980549 (Why is no real title available?)
- A linear algorithm for computing the visibility polygon from a point
- An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line Problem
- Sorting on a mesh-connected parallel computer
- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
- Translation separability of sets of polygons
- Visibility of a simple polygon
Cited in
(7)- scientific article; zbMATH DE number 4050999 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3866618 (Why is no real title available?)
- scientific article; zbMATH DE number 3894498 (Why is no real title available?)
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)
