Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

CiteULike is a free service for managing and discovering scholarly references - click here to get started.

Sign In to gain access to subscriptions and/or personal tools.
International Journal of High Performance Computing Applications
This Article
Right arrow Full Text (PDF)
Right arrow References
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 Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Strip, D.
Right arrow Articles by Karasick, M.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Solid Modeling On a Massively Parallel Processor

David Strip

SANDIA NATIONAL LABORATORIES ALBUQUERQUE, NEW MEXICO

Michael Karasick

MANUFACTURING RESEARCH DEPARTMENT IBM RESEARCH DIVISION YORKTOWN HEIGHTS, NEW YORK

Solid modeling underlies many technologies that are key to modern manufacturing. These range from com puter-aided design systems to robot simulators, from finite element analysis to integrated circuit process modeling. The accuracy, and hence the utility, of these models is often constrained by the amount of com puter time required to perform the desired operations. We present a family of algorithms for solid modeling operations using the Connection Machine, a massively parallel SIMD processor. We describe a data structure for representing solid models and algorithms that use the representation to implement efficiently a variety of solid modeling operations. We give a sketch of the al gorithm for intersecting solids and present computa tional experience using these algorithms. The data structure and algorithms are contrasted with those of serial architectures, and execution times are compared.

International Journal of High Performance Computing Applications, Vol. 6, No. 2, 175-192 (1992)
DOI: 10.1177/109434209200600205


Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?