Name
Abstract | ||
|---|---|---|
We describe a new parallel polygonclipping algorithm based on a novel technique that allows a processor to compute output vertices independently of the results of the other processors. The basis for the method is a collision-free labeling scheme to compute the labels of the vertices of the output polygon. This labeling scheme depends only on the id of the vertices of the output polygon. This labeling scheme depends only on the id of the vertex in the input polygon. This procedure allows us to defer the synchronization between processors to the final stages of the algorithm, reduces the amount of overhead due to fine-grain synchronization, and helps makes the algorithm efficient. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/BF01725102 | The Visual Computer |
Keywords | Field | DocType |
Polygon clipping, parallel, polygon clipping, vertex labeling, polygon clipping, multithreading | Multithreading,Synchronization,Polygon,Vertex (geometry),Computer science,Parallel algorithm,Algorithm,Polygon clipping | Journal |
Volume | Issue | ISSN |
12 | 3 | 1432-2315 |
Citations | PageRank | References |
3 | 0.41 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chandrasekhar Narayanaswami | 1 | 448 | 74.43 |