Efficient convex hull computation on the reconfigurable mesh

Reisis Dionisios, I

dc.contributor.author	Reisis Dionisios, I	en
dc.date.accessioned	2014-03-01T02:40:56Z
dc.date.available	2014-03-01T02:40:56Z
dc.date.issued	1992	en
dc.identifier.issn	01903918	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30288
dc.subject	Convex Hull	en
dc.subject	Parallel Algorithm	en
dc.subject	Parallel Sorting	en
dc.subject.other	Algorithms	en
dc.subject.other	Computational complexity	en
dc.subject.other	Computational methods	en
dc.subject.other	Data handling	en
dc.subject.other	Geometry	en
dc.subject.other	Sorting	en
dc.subject.other	Convex hull computation	en
dc.subject.other	Parallel enumerating techniques	en
dc.subject.other	Parallel sorting techniques	en
dc.subject.other	Reconfigurable mesh	en
dc.subject.other	Parallel processing systems	en
dc.title	Efficient convex hull computation on the reconfigurable mesh	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/IPPS.1992.223057	en
heal.identifier.secondary	http://dx.doi.org/10.1109/IPPS.1992.223057	en
heal.publicationDate	1992	en
heal.abstract	We present a fast parallel solution to the convex hull problem on a two dimensional reconfigurable mesh. Our parallel algorithm computes the convex hull of N1/2 planar points on a N1/2×N1/2 reconfigurable mesh. The algorithm is very efficient and completes the convex hull computation in O(1) time. We also show efficient parallel sorting of N1/2 data items on the reconfigurable mesh and improved parallel enumerating techniques utilized as basic steps in the convex hull computation.	en
heal.publisher	Publ by IEEE, Piscataway, NJ, United States	en
heal.journalName	Proceedings of the International Conference on Parallel Processing	en
dc.identifier.doi	10.1109/IPPS.1992.223057	en
dc.identifier.spage	142	en
dc.identifier.epage	145	en