Solving visibility problems on MCCs of smaller size
From MaRDI portal
Publication:2638829
DOI10.1016/0020-0255(91)90029-TzbMath0717.68103MaRDI QIDQ2638829
Publication date: 1991
Published in: Information Sciences (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Geometric problems on two-dimensional array processors
- Graph Problems on a Mesh-Connected Processor Array
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
- A linear algorithm for computing the visibility polygon from a point
- Sorting on a mesh-connected parallel computer
- On the Number of Stable States in a NOR Network