Parallel triangulation of a polygon in two calls to the trapezoidal map

Research output: Contribution to journalArticle

Abstract

We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in time O(log n) using O(n) CREW PRAM processors.

Original languageEnglish (US)
Pages (from-to)279-288
Number of pages10
JournalAlgorithmica (New York)
Volume3
Issue number1-4
DOIs
StatePublished - Nov 1988

Fingerprint

Triangulation
Polygon
Simple Polygon
Parallel Methods
Monotone
Partition

Keywords

  • Parallel algorithm
  • Polygon
  • Triangulation

ASJC Scopus subject areas

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

Cite this

Parallel triangulation of a polygon in two calls to the trapezoidal map. / Yap, Chee.

In: Algorithmica (New York), Vol. 3, No. 1-4, 11.1988, p. 279-288.

Research output: Contribution to journalArticle

@article{34f0d5d723d34e8caba397df73d56349,
title = "Parallel triangulation of a polygon in two calls to the trapezoidal map",
abstract = "We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in time O(log n) using O(n) CREW PRAM processors.",
keywords = "Parallel algorithm, Polygon, Triangulation",
author = "Chee Yap",
year = "1988",
month = "11",
doi = "10.1007/BF01762118",
language = "English (US)",
volume = "3",
pages = "279--288",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "1-4",

}

TY - JOUR

T1 - Parallel triangulation of a polygon in two calls to the trapezoidal map

AU - Yap, Chee

PY - 1988/11

Y1 - 1988/11

N2 - We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in time O(log n) using O(n) CREW PRAM processors.

AB - We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in time O(log n) using O(n) CREW PRAM processors.

KW - Parallel algorithm

KW - Polygon

KW - Triangulation

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

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

U2 - 10.1007/BF01762118

DO - 10.1007/BF01762118

M3 - Article

VL - 3

SP - 279

EP - 288

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 1-4

ER -