Please use this identifier to cite or link to this item:
|Title:||Synthesizing Data Structure Requirements from Algorithm Specifications : Case Studies from Recursive Subdivision for Computer Graphics and Animation,||Authors:||Abbas, Abdulwahed
Nasri, Ahmad H
|Affiliations:||Department of Computer Science||Keywords:||Algorithm theory
Program control structures
|Subjects:||Data structures (Computer science)
|Issue Date:||2003||Publisher:||IEEE||Part of:||ACS/IEEE International Conference on Computer Systems and Applications, 2003||Conference:||ACS/IEEE International Conference on Computer Systems and Applications (14-18 July 2003 : Tunis, Tunisia)||Abstract:||
Summary form only given. We propose that the data structure requirements of an algorithm may be synthesized from the algorithm specification. The evidence of that is drawn from observing that the flow of control of an algorithm is governed every step of the way by the information it gets from its data structure, which somehow should imply strong constraints on the way this data structure should be constructed. This in turn must have an impact on the global efficiency of the algorithm, since that is very much dependent on the ease with which such information can thus be obtained. This investigation is conducted through a couple of nontrivial algorithms in the area of recursive subdivision, a central area of research in computer-aided geometric design and computer graphics. The conclusions of this investigation are further verified through robust implementations of these algorithms with the supporting data structures drawn from this investigation.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/848||Ezproxy URL:||Link to full text||Type:||Conference Paper|
|Appears in Collections:||Department of Computer Science|
Show full item record
checked on May 18, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.