13th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'07)
Parallel algorithms for chains and anti-chains of points on a plane
Hsinchu, Taiwan
December 05-December 07
ISBN: 978-1-4244-1889-3
In this paper we describe efficient parallel algorithms for computing canonical chains and canonical antichains partition of a set of points on a plane. The problem to compute chain and anti-chain partition is of interest in VLSI design [LS92], computational geometry [MW92] and in computational molecular biology [Pev01]. A new affine transformation on the set of points is defined which transforms chains in the original point set into anti-chains in the transformed point set.
Citation:
null Gur Saran Adhar, "Parallel algorithms for chains and anti-chains of points on a plane," icpads, vol. 1, pp.1-7, 13th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'07), 2007