Thumbnail
Access Restriction
Open

Author Chang, Jacqueline D. ♦ Milenkovic, Victor
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Exact Geometric Computation ♦ Polyhedral Solid ♦ Sheer Number ♦ Geometric Algorithm ♦ Experiment Using Ln ♦ Sufficient Amount ♦ Naive Floating-point Algorithm ♦ Precompiled Limit ♦ Experimental Application
Description this paper we describe an experimental application of LN to the task of implementing a geometric algorithm. We first implemented a naive floating-point algorithm for taking the union and intersection of polyhedral solids and then translated it into LN. This algorithm was chosen because it is relatively small but requires a sufficient amount of computation to test the practicality of LN. The translation exceeded the precompiled limits of the system because of the sheer number of expressions required, even though the algorithm is relatively simple.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1993-01-01
Publisher Institution University of Waterloo