ACM Home Page
Please provide us with feedback. Feedback
Performing geometric transformations by program transformation
Full text PdfPdf (845 KB)
Source ACM Transactions on Graphics (TOG) archive
Volume 9 ,  Issue 1  (January 1990) table of contents
Pages: 28 - 40  
Year of Publication: 1990
ISSN:0730-0301
Authors
Robin A. Nicholl  The Univ. of Western Ontario, London, Canada
Tina M. Nicholl  The Univ. of Western Ontario, London, Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/77635.77637
What is a DOI?

ABSTRACT

Problems in geometry often possess symmetry properties that may be exploited in order to develop solutions. Algorithms based on these symmetry properties will frequently use geometric transformations to transform one case into another (symmetric) case. One advantage of this approach is that the algorithm avoids enumeration of cases and thus is shorter and generally easier to read. One disadvantage is that some additional execution time is required to perform these transformations. We describe how simple program equivalences may be used as program transformations to eliminate this additional execution time from programs that use geometric transformations. This approach has been used to develop an efficient implementation of a new algorithm for the two-dimensional line-clipping problem.



Collaborative Colleagues:
Robin A. Nicholl: colleagues
Tina M. Nicholl: colleagues

Peer to Peer - Readers of this Article have also read: