Parallel algorithms for separation of two sets of points and recognition of digital convex polygons

Journal Article · Tue Mar 31 23:00:00 EST 1992 · International Journal of Parallel Programming; (United States)

DOI:https://doi.org/10.1007/BF01408289· OSTI ID:7279706

Sarkar, D ^[1]; Stojmenovic, I ^[2]

---

1. Univ. of Miami, Coral Gables, FL (United States)
2. Univ. of Ottawa, Ontario (Canada)

Given two finite sets of points in a plane, the polygon separation problem is to construct a separating convex k-gon with smallest k. In this paper, we present a parallel algorithm for the polygon separation problem. The algorithm runs in O(log n) time on a CREW PRAM with n processors, where n is the number of points in the two given sets. The algorithm is cost-optimal, since [Omega](n log n) is a lower-bound for the first time needed by any sequential algorithm. We apply this algorithm to the problem of finding a convex region is its digital image. The algorithm in this paper constructs one such polygon with possibly two more edges than the minimal one.

• OSTI ID: 7279706
• Journal Information: International Journal of Parallel Programming; (United States), Journal Name: International Journal of Parallel Programming; (United States) Vol. 21:2; ISSN IJPPE5; ISSN 0885-7458
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
CALCULATION METHODS
COMPUTER ARCHITECTURE
DATA-FLOW PROCESSING
MATHEMATICAL LOGIC
OPTIMIZATION
PARALLEL PROCESSING
PROGRAMMING
SADDLE-POINT METHOD