Skip Navigation

The Computer Journal 1981 24(4):353-357; doi:10.1093/comjnl/24.4.353
© 1981 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bowyer, A.
Right arrow Articles by Woodward, J. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A multiprocessor architecture for solving spatial problems

A. Bowyer1 *, P. J. Willis1 * and J. R. Woodward2 §

1 School of Mathematics, University of Bath, Claverton Down, Bath, UK, 2 School of Engineering, University of Bath, Claverton Down, Bath, UK

A multiprocessor architecture for the solution of spatial and graphical problems by recursive subdivision is proposed. The trees that result from such divisions are mapped on to a closed graph, which is then considered as a network of processors. Simulations of these configurations have been performed with encouraging results. Proposals are made for the implementation of such machines.

Received October 1980.

* School of Mathematics, University of Bath, Claverton Down, Bath, BA2 7AY, UK

§ School of Engineering, University of Bath, Claverton Down, Bath, BA2 7AY, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.