### Abstract

In this paper we give a parallel algorithm for constructing the Voronoi diagram of a polygonal scene, i.e., a set of line segments in the plane such that no two segments intersect except possibly at their endpoints. Our algorithm runs in O(log^{2}n) time using O(n) processors in the CREW PRAM model.

Original language | English (US) |
---|---|

Title of host publication | Algorithms and Data Structures - Workshop, WADS 1989, Proceedings |

Publisher | Springer Verlag |

Pages | 12-23 |

Number of pages | 12 |

Volume | 382 LNCS |

ISBN (Print) | 9783540515425 |

DOIs | |

State | Published - 1989 |

Event | Workshop on Algorithms and Data Structures, WADS 1989 - Ottawa, Canada Duration: Aug 17 1989 → Aug 19 1989 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 382 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | Workshop on Algorithms and Data Structures, WADS 1989 |
---|---|

Country | Canada |

City | Ottawa |

Period | 8/17/89 → 8/19/89 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Algorithms and Data Structures - Workshop, WADS 1989, Proceedings*(Vol. 382 LNCS, pp. 12-23). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 382 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-51542-9_3

**Constructing the Voronoi diagram of a set of line segments in parallel.** / Goodrich, Michael T.; Ó’Dúnlaing, Colm; Yap, Chee.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Algorithms and Data Structures - Workshop, WADS 1989, Proceedings.*vol. 382 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 382 LNCS, Springer Verlag, pp. 12-23, Workshop on Algorithms and Data Structures, WADS 1989, Ottawa, Canada, 8/17/89. https://doi.org/10.1007/3-540-51542-9_3

}

TY - GEN

T1 - Constructing the Voronoi diagram of a set of line segments in parallel

AU - Goodrich, Michael T.

AU - Ó’Dúnlaing, Colm

AU - Yap, Chee

PY - 1989

Y1 - 1989

N2 - In this paper we give a parallel algorithm for constructing the Voronoi diagram of a polygonal scene, i.e., a set of line segments in the plane such that no two segments intersect except possibly at their endpoints. Our algorithm runs in O(log2n) time using O(n) processors in the CREW PRAM model.

AB - In this paper we give a parallel algorithm for constructing the Voronoi diagram of a polygonal scene, i.e., a set of line segments in the plane such that no two segments intersect except possibly at their endpoints. Our algorithm runs in O(log2n) time using O(n) processors in the CREW PRAM model.

UR - http://www.scopus.com/inward/record.url?scp=84983639860&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84983639860&partnerID=8YFLogxK

U2 - 10.1007/3-540-51542-9_3

DO - 10.1007/3-540-51542-9_3

M3 - Conference contribution

AN - SCOPUS:84983639860

SN - 9783540515425

VL - 382 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 12

EP - 23

BT - Algorithms and Data Structures - Workshop, WADS 1989, Proceedings

PB - Springer Verlag

ER -