Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region

Asano, Tomohiko; Umeo, Hiroshi

doi:10.1007/3-540-18099-0_31

Cited by 6 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently [5] presented an O (N) time parallel algorithms for solving both of the above visibility problems on a linear processor array of size N; i.e., a linear arrangement of N PEs where each PE is connected to its both neighbors (if they exist). Recently [5] presented an O (N) time parallel algorithms for solving both of the above visibility problems on a linear processor array of size N; i.e., a linear arrangement of N PEs where each PE is connected to its both neighbors (if they exist).…”

Section: Overview Of Resultsmentioning

confidence: 99%

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

Dehne

1988

The Visual Computer

View full text Add to dashboard Cite

In this paper we study parallel algorithms for the Mesh-of-Processors architecture to solve visibility and related separability problems for sets of simple polygons in the plane. In particular, we present the following algorithms: -An O(]//N time algorithm for computing on a Mesh-of-Processors of size N the visibility polygon from a point located in an N-vertex polygon, possibly with holes. -O(~/N) time algorithms for computing on a Mesh-of-Processors of size N the set of all points on the boundary of an N-vertex polygon P which are visible in a given direction d as well as the visibility hull of IP for a given direction d. An O (VN) time algorithm for detecting on a Mesh-of-Processors of size 2N whether two N-vertex polygons are separable in a given direction and an O(~) time algorithm for detecting on a Mesh-of-Processors of size MN whether M N-vertex polygons are sequentially separable in a given direction.All proposed algorithms are asymptotically optimal (for the Mesh-of-Processors) with respect to time and number of processors.

show abstract

Section: Overview Of Resultsmentioning

confidence: 99%

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

Dehne

1988

The Visual Computer

View full text Add to dashboard Cite

show abstract

CAM‐based hardware engine for geometrical problems in VLSI design

Suzuki

Ohtsuki

1990

Electron Comm Jpn Pt III

View full text Add to dashboard Cite

A new hardware engine called CHARGE (CAM‐based Hardware Engine for Geometrical Problems) is presented to accelerate basic geometrical search algorithms for VLSI layout design and verification. Due to the world‐parallel nature of the Content Addressable Memory (CAM), basic geometrical search problems can be solved in constant time, independent of the number of geometrical data. This approach has flexibility to exclude complicated coding for various data structures depending on subproblems. The architecture of CHARGE and performance data measured on a prototype machine are described.

show abstract