#### Filter Results:

#### Publication Year

1983

2001

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A parallel algorithm for computing the visible portions of a simple polygonal chain with n vertices from a point in the plane is presented. The algorithm runs m O(log n) time using 0(n / log n) processors in the EREW-PRAM computational model, and hence is asymptotically optimal. Nonnumerical Algorithms and Problems—computations on discrete structures.… (More)

Our model of computation is a parallel computer with k synchronized processors PI,...,Pk sharing a common random access storage, where simultaneous access to the same storage location by two or more processors is not allowed. Suppose a 2-3 tree T with n leaves is implemented in the storage, suppose al,...,a k are data that may or may not be stored in the… (More)

This paper continues with the study of the communication modes introduced in, University of Paderborn. (Extended abstract presented at WG'93.)] as a generalization of the standard one-way and two-way modes allowing to send messages between processors of interconnection networks via vertex-disjoint paths in one communication step. The complexity of… (More)

The communication power of the one-way and two-way edge-disjoint path modes for broadcast and gossip is investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). The main results achieved are the following: 1. For each connected graph G n of n nodes, the complexity of broadcast in G n , B min (G n),… (More)

Holography is a method for three-dimensional imaging of objects. In this paper we present an approach for the generation of holograms, exploiting standard graphics rendering methods and hardware. We focus on the visual-ization of objects composed of line segments, which allow for certain simplifications, and thus hologram generation speed-up. Our method is… (More)

Classiication: theory of parallel and distributed computation, parallel algorithms. Abstract. The sizes of permutation networks for special sets of permutations are investigated. The study of the planar realization and the search for small but hard sets of permutations are also included. Several asymptotically optimal estimations for distinct subsets of the… (More)