PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS.

Chang-Sung Jeong, D. T. Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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 languageEnglish
Title of host publicationUnknown Host Publication Title
Place of PublicationNew York, NY, USA
PublisherIEEE
Pages311-318
Number of pages8
ISBN (Print)0818608110
Publication statusPublished - 1987 Dec 1
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS.'. Together they form a unique fingerprint.

  • Cite this

    Jeong, C-S., & Lee, D. T. (1987). PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS. In Unknown Host Publication Title (pp. 311-318). IEEE.