Parallel geometric algorithms on a mesh-connected computer

Chang-Sung Jeong, D. T. Lee

Research output: Contribution to journalArticle

22 Citations (Scopus)


We show that a number of geometric problems can be solved on a √n × √n mesh-connected computer (MCC) in O(√n) time, which is optimal to within a constant factor, since a nontrivial data movement on an MCC requires Ω(√n) time. The problems studied here include multipoint location, planar point location, trapezoidal decomposition, intersection detection, intersection of two convex polygons, Voronoi diagram, the largest empty circle, the smallest enclosing circle, etc. The O(√n) algorithms for all of the above problems are based on the classical divide-and-conquer problem-solving strategy.

Original languageEnglish
Pages (from-to)155-177
Number of pages23
JournalAlgorithmica (New York)
Issue number2
Publication statusPublished - 1990 Jan 1
Externally publishedYes


ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Safety, Risk, Reliability and Quality
  • Applied Mathematics

Cite this