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

Fingerprint

Parallel algorithms
Decomposition

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Jeong, C-S., & Lee, D. T. (1987). PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS. In 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.

Unknown Host Publication Title. New York, NY, USA : IEEE, 1987. p. 311-318.

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

Jeong, C-S & Lee, DT 1987, PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS. in Unknown Host Publication Title. IEEE, New York, NY, USA, pp. 311-318.
Jeong C-S, Lee DT. PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS. In Unknown Host Publication Title. New York, NY, USA: IEEE. 1987. p. 311-318
Jeong, Chang-Sung ; Lee, D. T. / PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS. Unknown Host Publication Title. New York, NY, USA : IEEE, 1987. pp. 311-318
@inproceedings{68671d0aa8eb47d4935e6ebf60e841e2,
title = "PARALLEL GEOMETRIC ALGORITHMS ON MESH-CONNECTED COMPUTERS.",
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.",
author = "Chang-Sung Jeong and Lee, {D. T.}",
year = "1987",
month = "12",
day = "1",
language = "English",
isbn = "0818608110",
pages = "311--318",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

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 -