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 20 of 61

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

_id	4517
authors	Fuchs, Henry, Kedem, Zvi M. and Naylor, Bruce F.
year	1979
title	Predetermining Visibility Priority in 3-D Scenes
source	SIGGRAPH '79 Conference Proceedings. August, 1979. vol. 13 ; no. 2: pp. 175-181 : ill. includes bibliography
summary	The principal calculation performed by all visible surface algorithms is the determination of the visible polygon at each pixel in the image. Of the many possible speedups and efficiencies found for this problem, only one published algorithm (developed almost a decade ago by a group at General Electric) took advantage of an observation that many visibility calculations could be performed without knowledge of the eventual viewing position and orientation -- once for all possible images. The method is based on a 'potential obscuration' relation between polygons in the simulated environment. Unfortunately, the method worked only for certain objects; unmanageable objects had to be manually (and expertly!) subdivided into manageable pieces. Described in this paper is a solution to this problem which allows substantial a-priori visibility determination for all possible objects without any manual intervention. The method also identifies the (hopefully, few) visibility calculations which remain to be performed after the viewing position is specified. Also discussed is the development of still stronger solutions which could further reduce the number of these visibility calculations remaining at image generation time
keywords	algorithms, hidden lines, hidden surfaces, computer graphics
series	CADline
last changed	2003/06/02 13:58

_id	a4cc
authors	Hunter, Gregory M. and Steiglitz, Kenneth
year	1979
title	Operations on Images Using Quad Trees
source	IEEE Transactions on Pattern Analysis and Machine Intelligence. April, 1979. vol. PAMI-1: pp. 145-153 : ill. includes bibliography
summary	A quad tree for representing a picture is a tree in which successively deeper levels represent successively finer subdivisions of picture area. An algorithm is given for superposing N quad trees in time proportional to the total number of nodes in the trees. Warnock-type algorithms are then presented for building the quad tree for the picture of the boundary of a polygon, and for coloring the interior of such a polygon. These algorithms take O(v + p + q) time, where v is the number of polygon vertices, p is the polygon perimeter, and q is a resolution parameter. When the resolution q is fixed, these algorithms are asymptotically optimal
keywords	GIS, mapping, CAD, layout, pattern recognition, polyhedra, quadtree, planning, image processing, computer graphics
series	CADline
last changed	2003/06/02 13:58

_id	c6a9
authors	Kay, Douglas Scott and Greenberg, Donald P.
year	1979
title	Transparency for Computer Synthesized Images
source	SIGGRAPH '79 Conference Proceedings. August, 1979. vol. 13 ; no. 2: pp. 158-164 : ill. (some col.). includes bibliography
summary	Simple transparency algorithms which assume a linear transparency over an entire surface are the type most often employed to produce computer synthesized images of transparent objects with curved surfaces. Although most of the images created with these algorithms do give the impression of transparency, they usually do not look realistic. One of the most serious problems is that the intensity of the light that is transmitted through the objects is generally not proportional to the amount of material through which it must pass. Another problem is that the image seen behind the objects is not distorted as would naturally occur when the light is refracted as it passes through a material of different density. Use of a non-linear transparency algorithm can provide a great improvement in the realism of an image at a small additional cost. Making the transparency proportional to the normal to the surface causes it to decrease towards the edges of the surface where the path of the light through the object is longer. The exact simulation of refraction, however, requires that each sight ray be individually traced from the observer, through the picture plane and through each transparent object until an opaque surface is intersected. Since the direction of the ray would change as each material of differing optical density was entered, the hidden surface calculations required would be very time consuming. However, if a few assumptions are made about the geometry of each object and about the conditions under which they are viewed, a much simpler algorithm can be used to approximate the refractive effect. This method proceeds in a back-to-front order, mapping the current background image onto the next surface, until all surfaces have been considered
keywords	computer graphics, shading, transformation, display, visualization, algorithms, realism
series	CADline
last changed	2003/06/02 13:58

_id	4a66
authors	Lane, Jeffrey M. and Carpenter, Edward
year	1979
title	A Generalized Scan Line Algorithm for the Computer Display of Parametrically Defined Surfaces
source	Computer Graphics and Image Processing Academic Press Inc., 1979. vol. 11: pp. 290-297 : ill. includes bibliography.
summary	A scan line method is presented for creating shaded pictures of parametrically defined curved surfaces of piecewise continuity class C2. The algorithm uses a new subdivision technique to produce appropriate polygons for smooth shaded pictures. The approach results in smoothly curved silhouettes
keywords	curved surfaces, CAD, CAM, computer graphics, display, rendering, visualization, shading, algorithms
series	CADline
last changed	2003/06/02 10:24

_id	cebc
authors	Rhodes, Michael L.
year	1979
title	An Algorithmic Approach to Controlling Search in Three-Dimensional Image Data
source	SIGGRAPH '79 Conference Proceedings. August, 1979. vol. 13 ; no. 2: pp. 134- 141 : ill. includes bibliography
summary	In many three-dimensional imaging applications random shaped objects, reconstructed from serial sections, are isolated to display their overall structure in a single view. This paper presents an algorithm to control an ordered search strategy for locating all contours of random shaped objects intersected by a series of cross-section image planes. Classic search techniques in AI problem solving and software for image processing and computer graphics are combined here to aid program initialization and automate the search process thereafter. Using three-dimensional region growing, this method isolates all spatially connected pixels forming a structure's volume and enters image planes the least number of times to do so. An algorithmic description is given to generalize the process for controlling search in 3-D image data where little core memory is available. Phantom and medical computer tomographic data are used to illustrate the algorithm's performance
keywords	algorithms, AI, image processing, computer graphics, methods, search
series	CADline
last changed	2003/06/02 10:24

_id	7e54
authors	Ömer, Akin
year	1979
title	Models of Architectural Knowledge - An Information Processing Model of Design
source	Carnegie Mellon University, College of Fine Arts, Pittsburgh
summary	Throughout the history of art the position of the artist towards his goals and his product has been constantly redefined. The two opposing views in the above quotation, those of . German Romanticism and Classicism, are typical of the temperamental nature of the state of the art. Today's artist uses intuition as well as reason in his creative work. Similarly, whether we consider the architect an artist or a scientist, he is constantly required to use his intellectal as well as emotional resources while designing. I do not intend to endorse an attitude for the architect which condones only one of those sources at the expense of the other. Today there i s a real opportunity for understanding the reasoning used in problem-solving and applying these to the area of architectural design, the opportunity arises due to a large amount of knowledge accumulated in the area of ' human problem-solving, methods of anlayzing and developing models for human problem solving behavior. The most frequently refered points of departure in this area are Simon's pioneering work in the area of decision-making (1944) and Newell, Shaw and Simon's work on "heuristics" (1957).
series	thesis:PhD
email
last changed	2003/02/12 22:39

_id	f42f
authors	Baer, A., Eastman, C. and Henrion, M.
year	1979
title	Geometric modeling: a survey
source	Computer Aided Design; 11: 253
summary	Computer programs are being developed to aid the design of physical systems ranging from individual mechanical parts to entire buildings or ships. These efforts highlight the importance of computer models of three dimensional objects. Issues and alternatives in geometric modelling are discussed and illustrated with comparisons of 11 existing modelling systems, in particular coherently-structured models of polyhedral solids where the faces may be either planar or curved. Four categories of representation are distinguished: data representations that store full, explicit shape information; definition languages with which the user can enter descriptions of shapes into the system, and which can constitute procedural representations; special subsets of the information produced by application programs; and conceptual models that define the logical structure of the data representation and/or definition language.
series	journal paper
last changed	2003/04/23 15:14

_id	60d4
authors	Baer, A., Eastman, C.M. and Henrion, M.
year	1979
title	Geometric Modeling : a Survey
source	business Press. September, 1979. vol. 11: pp. 253-271 : ill. includes bibliography
summary	Computer programs are being developed to aid the design of physical systems ranging from individual mechanical parts to entire buildings or ships. These efforts highlight the importance of computer models of three dimensional objects. Issues and alternatives in geometric modeling are discussed and illustrated with comparisons of 11 existing modelling systems, in particular coherently-structured models of polyhedral solids where the faces may be either planar or curved. Four categories of representation are distinguished: data representations that store full, explicit shape information; definition languages with which the user can enter description of shapes into the system, and which can constitute procedural representations; special subsets of the information produced by application programs; and conceptual models that define the logical structure of the dada representation and/or definition language
keywords	solid modeling, B-rep, CSG, languages, CAD, programming, data structures, boolean operations, polyhedra
series	CADline
email
last changed	2003/05/17 10:15

_id	caadria2018_033
id	caadria2018_033
authors	Bai, Nan and Huang, Weixin
year	2018
title	Quantitative Analysis on Architects Using Culturomics - Pattern Study of Prizker Winners Based on Google N-gram Data
source	T. Fukuda, W. Huang, P. Janssen, K. Crolla, S. Alhadidi (eds.), Learning, Adapting and Prototyping - Proceedings of the 23rd CAADRIA Conference - Volume 2, Tsinghua University, Beijing, China, 17-19 May 2018, pp. 257-266
doi	https://doi.org/10.52842/conf.caadria.2018.2.257
summary	Quantitative studies using the corpus Google Ngram, namely Culturomics, have been analyzing the implicit patterns of culture changes. Being the top-standard prize in the field of Architecture since 1979, the Pritzker Prize has been increasingly diversified in the recent years. This study intends to reveal the implicit pattern of Pritzker Winners using the method of Culturomics, based on the corpus of Google Ngram to reveal the relationship of the sign of their fame and the fact of prize-winning. 48 architects including 32 awarded and 16 promising are analyzed in the printed corpus of English language between 1900 and 2008. Multiple regression models and multiple imputation methods are used during the data processing. Self-Organizing Map is used to define clusters among the awarded and promising architects. Six main clusters are detected, forming a 3×2 network of fame patterns. Most promising architects can be told from the clustering, according to their similarity to the more typical prize winners. The method of Culturomics could expand the sight of architecture study, giving more possibilities to reveal the implicit patterns of the existing empirical world.
keywords	Culturomics; Google Ngram; Pritzker Prize; Fame Pattern; Self-Organizing Map
series	CAADRIA
email
last changed	2022/06/07 07:54

_id	00f3
authors	Baybars, Ilker and Eastman, Charles M.
year	1979
title	Generating the Underlying Graphs for Architectural Arrangements
source	10 p. : ill. Pittsburgh: School of Urban and Public Affairs, Carnegie Mellon University, April, 1979. Research report No.79. Includes bibliography
summary	The mathematical correspondence to a floorplan is a Metric Planar Graph. Several methods for systematic direct generation of metric planar graphs have been developed including polyominoes, March and Matela and shape grammars. Another approach has been to develop a spatial composition in two separate steps. The first step involves discrete variables, and consists of enumerating a defined set of non-metric planar graphs. The second step involves spatial dimensions, e.g. continuous variables, and maps the graphs onto the Euclidean plane, from which a satisfactory or optimal one is selected. This paper focusses on the latter 2-step process. It presents a general method of solving the first step, that is the exhaustive enumeration of a set of planar graphs. The paper consists of three sections: The first section is an introduction to graph theory. The second section presents the generation of maximal planar graphs. The last section summarizes the presentation and comments on the appropriateness of the method
keywords	graphs, floor plans, architecture, design, automation, space allocation
series	CADline
email
last changed	2003/05/17 10:15

_id	fcd6
authors	Berger, S.R.
year	1979
title	Artificial Intelligence and its impact on Coimputer-Aided Design
source	Design Studies, vol 1, no. 3
summary	This paper provides, for readers unfamiliar with the field, an introductory account of research which has been carried out in artificial intelligence. It attempts to distingussh between an artificial intelligence and a conventional computing approach and to assess the future influence of the former on computer-aided design.
series	journal paper
last changed	2003/04/23 15:14

_id	6733
authors	Bettels, Juergen and Myers, David R.
year	1986
title	The PIONS Graphics System
source	IEEE Computer Graphics and Applications. July, 1986. vol. 6: pp. 30-38 : col. ill. includes a short bibliography
summary	During 1979, CERN began to evaluate how interactive computer graphics displays could aid the analysis of high-energy physics experiments at the new Super Proton Synchrotron collider. This work led to PIONS, a 3D graphics system, which features the ability to store and view hierarchical graphics structures in a directed-acyclic-graph database. It is possible to change the attributes of these structures by making selections on nongraphical information also stored in the database. PIONS is implemented as an object-oriented message-passing system based on SmallTalk design principles. It supports multiple viewing transformations, logical input devices, and 2D and 3D primitives. The design allows full use to be made of display hardware that provides dynamic 3D picture transformation
keywords	visualization, computer graphics, database, systems, modeling
series	CADline
last changed	2003/06/02 13:58

_id	af53
authors	Boyer, E. and Mitgang, L.
year	1996
title	Building community: a new future for architecture education and practice
source	Carnegie Foundation for the Advancement of Teaching
summary	Internships, before and after graduation, are the most essential link connecting students to the world of practice. Yet, by all accounts, internship is perhaps the most troubled phase of the continuing education of architects. During this century, as architectural knowledge grew more complex, the apprenticeship system withered away and schools assumed much of the responsibility for preparing architects for practice. However, schools cannot do the whole job. It is widely acknowledged that certain kinds of technical and practical knowledge are best learned in the workplace itself, under the guidance of experienced professionals. All state accrediting boards require a minimum period of internship-usually about three years-before a person is eligible to take the licensing exam. The National Council of Architectural Registration Boards (NCARB) allows students to earn up to two years of work credit prior to acquisition of an accredited degree. The Intern Development Program (IDP), launched by NCARB and the American Institute of Architects in 1979, provides the framework for internship in some forty states. The program was designed to assure that interns receive adequate mentoring, that experiences are well-documented, and that employers and interns allocate enough time to a range of educational and vocational experiences to prepare students for eventual licensure. As the IDP Guidelines state, "The shift from school to office is not a transition from theory to pragmatism. It is a period when theory merges with pragmatism.... It's a time when you: apply your formal education to the daily realities of architectural practice; acquire comprehensive experience in basic practice areas; explore specialized areas of practice; develop professional judgment; continue your formal education in architecture; and refine your career goals." Whatever its accomplishments, however, we found broad consensus that the Intern Development Program has not, by itself, solved the problems of internship. Though we found mutually satisfying internship programs at several of the firms we visited or heard about around the country, at many others interns told us they were not receiving the continuing education and experience they needed. The truth is that architecture has serious, unsolved problems compared with other fields when it comes to supplying on-the-job learning experiences to induct students into the profession on a massive scale. Medicine has teaching hospitals. Beginning teachers work in actual classrooms, supported by school taxes. Law offices are, for the most part, in a better financial position to support young lawyers and pay them living wages. The architecture profession, by contrast, must support a required system of internship prior to licensure in an industry that has neither the financial resources of law or medicine, the stability and public support of teaching, nor a network of locations like hospitals or schools where education and practice can be seamlessly connected. And many employers acknowledged those problems. "The profession has all but undermined the traditional relationship between the profession and the academy," said Neil Frankel, FAIA, executive vice president of Perkins & Will, a multinational firm with offices in New York, Chicago, Washington, and London. "Historically, until the advent of the computer, the profession said, 'Okay, go to school, then we in the profession will teach you what the real world is like.' With the coming of the computer, the profession needed a skill that students had, and has left behind the other responsibilities." One intern told us she had been stuck for months doing relatively menial tasks such as toilet elevations. Another intern at a medium-sized firm told us he had been working sixty to seventy hours per week for a year and a half. "Then my wife had a baby and I 'slacked off' to fifty hours. The partner called me in and I got called on the carpet for not working hard enough." "The whole process of internship is being outmoded by economics," one frustrated intern told us. "There's not the time or the money. There's no conception of people being groomed for careers. The younger staff are chosen for their value as productive workers." "We just don't have the best structure here to use an intern's abilities to their best," said a Mississippi architect. "The people who come out of school are really problems. I lost patience with one intern who was demanding that I switch him to another section so that he could learn what he needed for his IDP. I told him, 'It's not my job to teach you. You are here to produce.'" What steps might help students gain more satisfying work opportunities, both during and after graduation?
series	other
last changed	2003/04/23 15:14

_id	819a
authors	Brassel, Kurt E. and Fegeas, Robin
year	1979
title	An Algorithm for Shading of Regions on Vector Display Devices
source	SIGGRAPH '79 Conference Proceedings. August, 1979. vol. 13 ; no. 2: pp. 126- 133 : ill. includes bibliography
summary	The display of shaded polygons by line, cross-hatch, and dot patterns on vector devices is a task frequently used in computer graphics and computer cartography. In applications such as the production of shaded maps polygon shading turns out to be critical with respect to time requirements, and the development of efficient algorithms is of importance. Given an arbitrary polygon in the plane without self-crossing edges (simply-connected polygon), the task at hand is to shade this polygon with one or two sets of parallel lines where for each set a shading angle and a line distance are given. The basic concept of this new algorithm is to decompose the polygon into a set of mutually exclusive trapezoids (in special cases triangles) where the parallel edges of the trioxides are parallel to the desired shading lines. These trapezoids and triangles are then shaded in a fast procedure. In its present form the algorithm handles regions with up to 300 islands. Possible extensions include the construction of dash and cross patterns
keywords	algorithms, polygons, software, computer graphics, shading, GIS, mapping, drafting, information
series	CADline
last changed	2003/06/02 13:58

_id	6d0b
authors	Brown, Bruce Eric
year	1979
title	Computer Graphics for Large Scale Two- and Three-Dimensional Analysis of Complex Geometries
source	SIGGRAPH '79 Conference Proceedings. August, 1979. vol. 13 ; no. 2: pp. 33-40 : ill. includes bibliography
summary	A comprehensive set of programs have been developed for analysis of complex two- and three- dimensional geometries. State of the art finite element and hydrodynamic codes are being used for the analytical portion of the work. Several additional codes depending heavily on graphics have been developed to assist the analytical effort. These are basically used for the pre- and post-processing of the data. Prior to running any analysis, the geometry of the body of interest must be represented in the form of small 'finite elements.' After the analysis is run, the data must be post-processed. Both spatial and temporal data exist in the database. It is the database between the analysis codes and the post- processors which allows a wide variety of analysis codes to use the same post-processors. The temporal plotting codes produce time histories for specified quantities (i.e. temperature, pressure, velocity, stress, etc.) at various locations within the body. They may also produce cross-plots of these variables (i.e. stress vs. strain at a particular position). One of the two codes used for plotting of the spatial data is for two-dimensional geometries and the other for three-dimensional models. For three dimensions, the Watkins' hidden surface / line processor is utilized for plots. The spatial plotters display contour lines on vector output devices and color fringes (or gray values) on raster output devices. They both may also display deformed geometries. Further the three-dimensional code has extensive animation capabilities for movie productions
keywords	computer graphics, finite elements, modeling, engineering, database, animation, mechanical engineering
series	CADline
last changed	1999/02/12 15:07

_id	4eb9
authors	Brown, Kevin Q.
year	1979
title	Dynamic Programming in Computer Science
source	44 p. : ill. Pittsburgh, PA: Department of Computer Science, CMU, February, 1979. CMU-CS-79-106. Includes bibliography
summary	This paper is a survey of dynamic programming algorithms for problems in computer science. For each of the problems the author derives the functional equations and provides numerous references to related results. For many of the problems a dynamic programming algorithm is explicitly given. In addition, the author presents several new problems and results
keywords	algorithms, problem solving, dynamic programming
series	CADline
last changed	2003/06/02 10:24

_id	22ce
authors	Cahn, Deborah U., Johnston, Nancy E. and Johnston, William E.
year	1977
title	A Response to the 1977 GSPC Core Graphic System
source	SIGGRAPH '79 Conference Proceedings. August, 1979. vol. 13 ; no. 2: pp. 57-62. includes bibliography
summary	This paper responds to the 1977 Core Graphics System of SIGGRAPH's Graphics Standards Planning Committee (GSPC). The authors are interested in low-level device-independent graphics for applications doing data representation and annotation. The level structure and bias in the core system toward display list processor graphics are criticized. Specific issues discussed include display contexts, attributes, current position, 3-dimensional graphics, area filling, and graphics input
keywords	computer graphics, standards
series	CADline
last changed	2003/06/02 13:58

_id	4435
authors	Cheatham, Th.E., Townley, J.A. and Holloway, G.H.
year	1979
title	A System for Program Refinement
source	1979. pp. 53-62. includes bibliography
summary	The Program Development System (PDS) is a programming environment, an integrated collection of interactive tools that support the process of program definition, testing, and maintenance. The PDS is intended to aid the development of large programs, especially program families whose members must be maintained in synchrony. The system facilitates implementation by stepwise refinement, and it keeps a refinement history that allows program modifications made at a high level of abstraction to be reflected efficiently and automatically in the corresponding low level code. Analysis tools are used both to support program validation and to guide program refinement
keywords	user interface, software, systems, programming, tools
series	CADline
last changed	2003/06/02 14:41

_id	9d45
authors	Ching, F.D.K.
year	1979
title	Architecture: Form, Space and Order
source	Van Nostrand Reinhold. New York
summary	The Second Edition of this classic introduction to the principles of architecture is everything you would expect from the celebrated architect, author, and illustrator, Francis D. K. Ching. Each page has been meticulously revised to incorporate contemporary examples of the principles of form, space, and order-the fundamental vocabulary of every designer. The result is a beautifully illustrated volume that embraces today's forms and looks at conventional models with a fresh perspective. Here, Ching examines every principal of architecture, juxtaposing images that span centuries and cross cultural boundaries to create a design vocabulary that is both elemental and timeless. Among the topics covered are point, line, plane, volume, proportion, scale, circulation, and the interdependence of form and space. While this revision continues to be a comprehensive primer on the ways form and space are interrelated and organized in the shaping of our environment, it has been refined to amplify and clarify concepts. In addition, the Second Edition contains: * Numerous new hand-rendered drawings * Expanded sections on openings and scale * Expanded chapter on design principles * New glossary and index categorized by the author * New 8 1/2 ? 11 upright trim In the Second Edition of Architecture: Form, Space, and Order, the author has opted for a larger format and crisper images. Mr. Ching has retained the style of his hand-lettered text, a hallmark of each of his books. This rich source of architectural prototypes, each rendered in Mr. Ching's signature style, also serves as a guide to architectural drawing. Doubtless, many will want this handsome volume for the sheer beauty of it. Architects and students alike will treasure this book for its wealth of practical information and its precise illustrations. Mr. Ching has once again created a visual reference that illuminates the world of architectural form.
series	other
last changed	2003/04/23 15:14

_id	e7b8
authors	Dahl, Veronica
year	1983
title	Logic Programming as a Representation of Knowledge
source	IEEE Computer. IEEE Computer Society, October, 1983. vol. 16: pp. 106-110 : ill. includes bibliography
summary	Logic has traditionally provided a firm conceptual framework for representing knowledge. As it can formally deal with the notion of logical consequence, the introduction of Prolog has made it possible to represent knowledge in terms of logic and also to expect appropriate inferences to be drawn from it automatically. This article illustrates and explores these ideas with respect to two central representational issues: problem solving knowledge and database knowledge. The technical aspects of both subjects have been covered elsewhere (Kowalski, R. Logic for problem solving, North- Holland pub. 1979 ; Dahl, V. on database system development through logic ACM Trans.vol.7/no.3/Mar.1982 pp.102). This explanation uses simple, nontechnical terms
keywords	PROLOG, knowledge, representation, logic, programming, problem solving, database
series	CADline
last changed	1999/02/12 15:08

For more results click below: