### Abstract

The authors provide almost optimal parallel algorithms in the following areas of computational geometry: (1) convex hulls in two and three dimensions; (2) Voronoi diagrams and proximity problems; (3) detecting segment intersections and triangulating a polygon; (4) geometric optimization problems; and (5) creating data structures in two and three dimensions to answer some standard queries.

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

Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |

Publisher | IEEE |

Pages | 468-477 |

Number of pages | 10 |

ISBN (Print) | 0818606444 |

State | Published - Dec 1 1985 |

### Publication series

Name | Annual Symposium on Foundations of Computer Science (Proceedings) |
---|

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Hardware and Architecture

### Cite this

*Annual Symposium on Foundations of Computer Science (Proceedings)*(pp. 468-477). (Annual Symposium on Foundations of Computer Science (Proceedings)). IEEE.

}

*Annual Symposium on Foundations of Computer Science (Proceedings).*Annual Symposium on Foundations of Computer Science (Proceedings), IEEE, pp. 468-477.

**PARALLEL COMPUTATIONAL GEOMETRY.** / Aggarwal, Alok; Chazelle, Bernard; Guibas, Leo; O'Dunlaing, Colm; Yap, Chee.

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

TY - GEN

T1 - PARALLEL COMPUTATIONAL GEOMETRY.

AU - Aggarwal, Alok

AU - Chazelle, Bernard

AU - Guibas, Leo

AU - O'Dunlaing, Colm

AU - Yap, Chee

PY - 1985/12/1

Y1 - 1985/12/1

N2 - The authors provide almost optimal parallel algorithms in the following areas of computational geometry: (1) convex hulls in two and three dimensions; (2) Voronoi diagrams and proximity problems; (3) detecting segment intersections and triangulating a polygon; (4) geometric optimization problems; and (5) creating data structures in two and three dimensions to answer some standard queries.

AB - The authors provide almost optimal parallel algorithms in the following areas of computational geometry: (1) convex hulls in two and three dimensions; (2) Voronoi diagrams and proximity problems; (3) detecting segment intersections and triangulating a polygon; (4) geometric optimization problems; and (5) creating data structures in two and three dimensions to answer some standard queries.

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

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

M3 - Conference contribution

SN - 0818606444

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 468

EP - 477

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -