Close category search window
 

Practical hypercube algorithms for computational geometry

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
MacKenzie, P.D. ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Stout, Q.F.

The use of the cross-stitching technique to solve problems in computational geometry on the hypercube is discussed. Given n inputs distributed one per processor on a hypercube with n processors. The cross-stitching paradigm runs in Θ(log2 n) time with very low constants. This form of 2-D divide-and-conquer is illustrated, some of its applications are considered, and its practicality is shown by the computation of exact communication constants for the authors' algorithms

Published in:
Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the

Date of Conference: 8-10 Oct 1990

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.