Cumincad : CUMINCAD Papers : Search Results

CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

PDF papers
References

Hits 1 to 4 of 4

Reformat results as: short short into frame detailed detailed into frame

_id	acadia06_068
id	acadia06_068
authors	Elys, John
year	2006
title	Digital Ornament
source	Synthetic Landscapes [Proceedings of the 25th Annual Conference of the Association for Computer-Aided Design in Architecture] pp. 68-78
doi	https://doi.org/10.52842/conf.acadia.2006.068
summary	Gaming software has a history of fostering development of economical and creative methods to deal with hardware limitations. Traditionally the visual representation of gaming software has been a poor offspring of high-end visualization. In a twist of irony, this paper proposes that game production software leads the way into a new era of physical digital ornament. The toolbox of the rendering engine evolved rapidly between 1974-1985 and it is still today, 20 years later the main component of all visualization programs. The development of the bump map is of particular interest; its evolution into a physical displacement map provides untold opportunities of the appropriation of the 2D image to a physical 3D object.To expose the creative potential of the displacement map, a wide scope of existing displacement usage has been identified: Top2maya is a scientific appropriation, Caruso St John Architects an architectural precedent and Tord Boonje’s use of 2D digital pattern provides us with an artistic production precedent. Current gaming technologies give us an indication of how the resolution of displacement is set to enter an unprecedented level of geometric detail. As modernity was inspired by the machine age, we should be led by current technological advancement and appropriate its usage. It is about a move away from the simplification of structure and form to one that deals with the real possibilities of expanding the dialogue of surface topology. Digital Ornament is a kinetic process rather than static, its intentions lie in returning the choice of bespoke materials back to the Architect, Designer and Artist.
series	ACADIA
email
last changed	2022/06/07 07:55

_id	caadria2007_353
id	caadria2007_353
authors	John, Elys
year	2007
title	Digital Ornament
source	CAADRIA 2007 [Proceedings of the 12th International Conference on Computer Aided Architectural Design Research in Asia] Nanjing (China) 19-21 April 2007
doi	https://doi.org/10.52842/conf.caadria.2007.x.i5h
summary	Gaming and visualisation software has a history of developing economical and creative methods to deal with hardware limitations. Traditionally the visual representation of gaming has been a poor offspring of high-end architectural visualisation. In a twist of irony, the paper proposes that game production software leads the way into a new era of physical digital ornament. The toolbox of the rendering engine evolved rapidly between 1974-85 and it is still today 20 years later the main component of all visualisation programs. The development of the bump map is of particular interest; its evolution into a physical displacement map provides untold opportunities in the appropriation of the 2D image to a physical artifact. Contemporary Architects in tandem have been mapping to the façade a new era of complex three-dimensional sculptural representation. The Architect, Designer and Artist now have the opportunity to appropriate the image map and use advanced visualisation technologies in the application of digital ornament.
series	CAADRIA
email
last changed	2022/06/07 07:50

_id	cdb0
authors	Finkel, R. A. and Bentley, Jon L.
year	1974
title	Quad Trees : A Data Structure for Retrieval on Composite Keys
source	Acta Informatica. 1974. vol. 4: pp. 1-9 : ill. includes bibliography
summary	The quad tree is a data structure appropriate for storing information to be retrieved on composite keys. The paper discusses the specific case of two-dimensional retrieval, although the structure is easily generalized to arbitrary dimensions. Algorithms are given both for straightforward insertion and for a type of balanced insertion into quad trees. Empirical analyses show that the average time for insertion is logarithmic with the tree size. An algorithm for retrieval within regions is presented along with data from empirical studies which imply that searching is reasonably efficient. The paper defines an optimized tree and presents an algorithm to accomplish optimization in n log n time. Searching is guaranteed to be fast in optimized trees. Remaining problems include those of deletion from quad trees and merging of quad trees, which seem to be inherently difficult operations
keywords	quadtree, data structures, algorithms, search, sorting
series	CADline
last changed	2003/06/02 13:58

_id	585a
authors	Gips, James Elliot
year	1974
title	Shape grammars and their uses : artificial perception, shape generation and computer aesthetics
source	Stanford University
summary	Shape grammars are defined and their uses investigated. Shape grammars provide a means for the recursive specification of shapes. The formalism for shape grammars is designed to be easily usable and understandable by people and at the same time to be adaptable for use in computer programs. Shape grammars are similar to phrase structure grammars, which were developed by Chomsky. Where a phrase structure grammar is defined over an alphabet of symbols and generates a language of sequences of symbols, a shape grammar is defined over an alphabet of shapes and generates a language of shapes. The dissertation is divided into three sections and an Appendix.In the first section: Shape grammars are defined. Some simple examples are given for instructive purposes. Shape grammars are used to generate a new class of reversible figures. Shape grammars are given for some well-known mathematical curves (the Snowflake curve, a variation of Peano's curve, and Hubert's curve). To show the general computational power of shape grammars, a procedure that given any Turing machine constructs a shape grammar that simulates the operation of that Turing machine is presented. Related work on various formalisms for picture grammars is described. A symbolic characterization of shape grammars is given that is useful for implementing shape grammars in computer programs. In the second section, a program that uses a shape grammar to solve a perceptual task is described. The task involves analyzing and comparing line drawings that portray three -dimensional objects of a restricted type. The third section is divided into two parts. First, a formalism for generating paintings is defined. The primary component of this formalism is a shape grammar. The paintings generated are material representations of shapes specified by shape grammars. The computer implementation of this formalism is described. The second part is concerned with aesthetics. A formalism is defined for specifying an aesthetic viewpoint. The formalism is used to specify a particular aesthetic viewpoint for interpreting and evaluating paintings generated using shape grammars. This viewpoint has been implemented on the computer. The net result is that the program described in Section 3 can be used to interactively define the rules for producing a painting, can use the rules to generate and display the resulting painting, and can then evaluate the painting relative to the specific aesthetic viewpoint. Relationships between the formalism for aesthetic viewpoints and information theory and science are touched upon. Finally, the possibility of using this approach to aesthetics to write programs that automatically analyze presented art objects or design new art objects is explored. In the Appendix, a method for constructing the inverse of a Turing machine is presented. This construction was created in response to a problem that is described in the aestheticssection.
keywords	Formal Languages; Computer Art; Aesthetics; Data Processing
series	thesis:PhD
email
more	http://jenson.stanford.edu
last changed	2003/02/12 22:37

No more hits.