### Abstract

It is shown that a number of geometric problems can be solved on a ROOT n ROOT multiplied by n mesh-connected computer (MCC) in O( ROOT n) time, which is optimal to within a constant factor, since a nontrivial data movement on an MCC requires OMEGA ( ROOT n) time. The problems studied include multipoint location, planar point location, trapezoidal decomposition, intersection detection, intersection of two convex polygons, and Voronoi diagrams. The O( ROOT n) algorithms for all of the above problems are based on the classical divide-and-conquer strategy.

Original language | English |
---|---|

Title of host publication | Unknown Host Publication Title |

Place of Publication | New York, NY, USA |

Publisher | IEEE |

Pages | 311-318 |

Number of pages | 8 |

ISBN (Print) | 0818608110 |

Publication status | Published - 1987 Dec 1 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Unknown Host Publication Title*(pp. 311-318). New York, NY, USA: IEEE.

**PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS.** / Jeong, Chang-Sung; Lee, D. T.

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

*Unknown Host Publication Title.*IEEE, New York, NY, USA, pp. 311-318.

}

TY - GEN

T1 - PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS.

AU - Jeong, Chang-Sung

AU - Lee, D. T.

PY - 1987/12/1

Y1 - 1987/12/1

N2 - It is shown that a number of geometric problems can be solved on a ROOT n ROOT multiplied by n mesh-connected computer (MCC) in O( ROOT n) time, which is optimal to within a constant factor, since a nontrivial data movement on an MCC requires OMEGA ( ROOT n) time. The problems studied include multipoint location, planar point location, trapezoidal decomposition, intersection detection, intersection of two convex polygons, and Voronoi diagrams. The O( ROOT n) algorithms for all of the above problems are based on the classical divide-and-conquer strategy.

AB - It is shown that a number of geometric problems can be solved on a ROOT n ROOT multiplied by n mesh-connected computer (MCC) in O( ROOT n) time, which is optimal to within a constant factor, since a nontrivial data movement on an MCC requires OMEGA ( ROOT n) time. The problems studied include multipoint location, planar point location, trapezoidal decomposition, intersection detection, intersection of two convex polygons, and Voronoi diagrams. The O( ROOT n) algorithms for all of the above problems are based on the classical divide-and-conquer strategy.

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

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

M3 - Conference contribution

AN - SCOPUS:0023560782

SN - 0818608110

SP - 311

EP - 318

BT - Unknown Host Publication Title

PB - IEEE

CY - New York, NY, USA

ER -