loading...
Parallel algorithms for chains and anti-chains of points on a plane
Hsinchu, Taiwan December 05-December 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPADS.2007.444774813th International Conference on Para ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
null Gur Saran Adhar, Computer Science Department, University of North Carolina, Wilmington, 28403, USA
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
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions