Offsets, sweeps, and Minkowski operations (M-ops) are easy to define in the existential (representation-free) mathematics of point sets, but computing 'values' for offset, swept, and M-summed entities is thought to be difficult by many. This article argues that such computations may be easy if (1) they are cast in specific application contexts, and (2) relevant mathematical definitions are discretized and implemented directly. The argument is based on 10 years of research on a range of motional, process-modeling, and visualization problems that involved offsetting, sweeping, and M-ops; the solution paradigm common to all was direct approximation of mathematical definitions, using ray representations and parallel computation as primary media. This article presents no new results; it merely summarizes a body of well documented research that illustrates an approach to problem solving, whose primary tenets are: compute only what you need to solve the problem at hand, and do that as directly as possible.
By: E. E. Hartquist, J. P. Menon, K. Suresh, H. B. Voelcker, J. Zagajac
Published in: RC21543 in 1999
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .