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 10 of 10

_id 315caadria2004
id 315caadria2004
authors Kuo-Chung Wen, Wei-Lung Chen
year 2004
title Application of Genetic Algorithms to Establish Flooding Evacuation Path Model in Metropolitan Area
source CAADRIA 2004 [Proceedings of the 9th International Conference on Computer Aided Architectural Design Research in Asia / ISBN 89-7141-648-3] Seoul Korea 28-30 April 2004, pp. 557-570
doi https://doi.org/10.52842/conf.caadria.2004.557
summary This research has shown the difficulties associated with the GIS and the flooding evacuation path search through the huge searching space generated during the network analysis process. This research also presents an approach to these problems by utilizing a search process whose concept is derived from natural genetics. Genetic algorithms (GAs) have been introduced in the optimization problem solving area by Holland (1975) and Goldberg (1989) and have shown their usefulness through numerous applications. We apply GA and GIS to choice flooding evacuation path in metropolitan area in this study. We take the region of Shiji city in Taiwan for case. That could be divided into four parts. First, is to set the population of GA operation. Second, is to choose crossover and mutation. Third, is to calculate the fitness function of each generation and to select the better gene arrangement. Fourth, is to reproduce, after evolution, we can establish Flooding Evacuation Path that more reflect really human action and choice when flood takes place. However we can apply GA to calculate different evacuation path in different time series. Final, we compare and establish real model of evacuation path model to choosing flooding evacuation path.
series CAADRIA
email
last changed 2022/06/07 07:52

_id ddss2004_d-63
id ddss2004_d-63
authors Wen, K.-C. and W.-L. Chen
year 2004
title Applying Genetic Algorithms to Establish Disaster Decision Support System for Flooding Evacuation Path of Hsichih Area in Taiwan
source Van Leeuwen, J.P. and H.J.P. Timmermans (eds.) Developments in Design & Decision Support Systems in Architecture and Urban Planning, Eindhoven: Eindhoven University of Technology, ISBN 90-6814-155-4, p. 63-75
summary Because of the special geography features and subtropics weather in Taiwan, we need to provide correct information to help people making decision when they are in disaster. So the disaster decision support system must offer proper information of evacuation path to people. This research has shown the difficulties associated with the GIS and the flooding evacuation path search through the huge searching space generated during the network analysis process. This research also presents an approach to these problems by utilizing a search process whose concept is derived from natural genetics. Genetic algorithms (GAs) have been introduced in the optimization problem solving area by Holland (1975) and Goldberg (1989) and have shown their usefulness through numerous applications. We apply GA and GIS to choice flooding evacuation path in metropolitan area in this study. We take the region of Shiji city in Taiwan for case. Firstly, we establish the node relationship of GA calculation, the level of the weight is the standard of the date that is exported by Disaster Database. Secondly, we apply GA to calculate different evacuation path in different time series. Finally, we build the model of choosing flooding evacuation path.
keywords Genetic Algorithms, Decision Support System, GIS, Evacuation Path
series DDSS
last changed 2004/07/03 22:13

_id 4bf3
authors Blinn, James F.
year 1989
title Optimal Tubes
source IEEE Computer Graphics and Applications. September, 1989. vol. 9: pp. 8-13 : ill. (some col.)
summary The author discusses how to cut down the number of polygons required to model and render the Voyager spacecraft. The geometric problem is to find the tangent lines from a point to a circle. There are two ways to go about solving this, one using garden-variety analytical geometry and the other using high tech homogeneous coordinates. The author in this column discusses the simple way
keywords programming, geometry, algorithms, computer graphics, techniques
series CADline
last changed 2003/06/02 13:58

_id 8bdf
authors Crocker, Gary A. and Reinke, William F.
year 1989
title Boundary Evaluation in a Non-Manifold Environment
source November, 1989. 30 p., [16] p. of ill. includes bibliography
summary The recent availability of Non-Manifold Topology (NMT) enables the coexistence of wireframe geometry, surfaces, and solids in a single representation with complete topological resolution. This in turn allows a new approach to boundary evaluation. This new approach merges a set of primitives into a single Boundary REPresentation (B-rep), and selects the desired Boolean results without destroying any B-rep entities. The results of the Boolean operations are displayed by drawing only selected entities. The B-rep resulting from the merge contains a complete description of the input primitives. While traditional algorithms allow incremental addition of primitives, this new approach also allows incremental deletion of primitives from the merged B-rep. Changes in Boolean operators and/or their order of evaluation can be reflected in the B-rep simply by changing the criteria of the selection process. Constructive Solid Geometry (CSG) editing operations can be mirrored in the B-rep incrementally, i.e. without performing complete reevaluation of the B-rep from its constituent primitive definitions. In addition, the domain of boundary evaluation has been extended to include Boolean operations between wireframe geometry, surfaces, and solids. This new approach has been successfully implemented and tested to boundary evaluation. Test results have shown an order of magnitude reduction in the cost associated with reflecting CSG editing operations on existing B-reps, with only minimal additional cost for initial construction. Also shown are examples of Boolean operations between solids, surfaces, and wires
keywords computational geometry, boolean operations, solid modeling, B-rep, CSG, representation, topology, curved surfaces, intersection, curves,
series CADline
last changed 2003/06/02 13:58

_id sigradi2006_e028c
id sigradi2006_e028c
authors Griffith, Kenfield; Sass, Larry and Michaud, Dennis
year 2006
title A strategy for complex-curved building design:Design structure with Bi-lateral contouring as integrally connected ribs
source SIGraDi 2006 - [Proceedings of the 10th Iberoamerican Congress of Digital Graphics] Santiago de Chile - Chile 21-23 November 2006, pp. 465-469
summary Shapes in designs created by architects such as Gehry Partners (Shelden, 2002), Foster and Partners, and Kohn Peterson and Fox rely on computational processes for rationalizing complex geometry for building construction. Rationalization is the reduction of a complete geometric shape into discrete components. Unfortunately, for many architects the rationalization is limited reducing solid models to surfaces or data on spread sheets for contractors to follow. Rationalized models produced by the firms listed above do not offer strategies for construction or digital fabrication. For the physical production of CAD description an alternative to the rationalized description is needed. This paper examines the coupling of digital rationalization and digital fabrication with physical mockups (Rich, 1989). Our aim is to explore complex relationships found in early and mid stage design phases when digital fabrication is used to produce design outcomes. Results of our investigation will aid architects and engineers in addressing the complications found in the translation of design models embedded with precision to constructible geometries. We present an algorithmically based approach to design rationalization that supports physical production as well as surface production of desktop models. Our approach is an alternative to conventional rapid prototyping that builds objects by assembly of laterally sliced contours from a solid model. We explored an improved product description for rapid manufacture as bilateral contouring for structure and panelling for strength (Kolarevic, 2003). Infrastructure typically found within aerospace, automotive, and shipbuilding industries, bilateral contouring is an organized matrix of horizontal and vertical interlocking ribs evenly distributed along a surface. These structures are monocoque and semi-monocoque assemblies composed of structural ribs and skinning attached by rivets and adhesives. Alternative, bi-lateral contouring discussed is an interlocking matrix of plywood strips having integral joinery for assembly. Unlike traditional methods of building representations through malleable materials for creating tangible objects (Friedman, 2002), this approach constructs with the implication for building life-size solutions. Three algorithms are presented as examples of rationalized design production with physical results. The first algorithm [Figure 1] deconstructs an initial 2D curved form into ribbed slices to be assembled through integral connections constructed as part of the rib solution. The second algorithm [Figure 2] deconstructs curved forms of greater complexity. The algorithm walks along the surface extracting surface information along horizontal and vertical axes saving surface information resulting in a ribbed structure of slight double curvature. The final algorithm [Figure 3] is expressed as plug-in software for Rhino that deconstructs a design to components for assembly as rib structures. The plug-in also translates geometries to a flatten position for 2D fabrication. The software demonstrates the full scope of the research exploration. Studies published by Dodgson argued that innovation technology (IvT) (Dodgson, Gann, Salter, 2004) helped in solving projects like the Guggenheim in Bilbao, the leaning Tower of Pisa in Italy, and the Millennium Bridge in London. Similarly, the method discussed in this paper will aid in solving physical production problems with complex building forms. References Bentley, P.J. (Ed.). Evolutionary Design by Computers. Morgan Kaufman Publishers Inc. San Francisco, CA, 1-73 Celani, G, (2004) “From simple to complex: using AutoCAD to build generative design systems” in: L. Caldas and J. Duarte (org.) Implementations issues in generative design systems. First Intl. Conference on Design Computing and Cognition, July 2004 Dodgson M, Gann D.M., Salter A, (2004), “Impact of Innovation Technology on Engineering Problem Solving: Lessons from High Profile Public Projects,” Industrial Dynamics, Innovation and Development, 2004 Dristas, (2004) “Design Operators.” Thesis. Massachusetts Institute of Technology, Cambridge, MA, 2004 Friedman, M, (2002), Gehry Talks: Architecture + Practice, Universe Publishing, New York, NY, 2002 Kolarevic, B, (2003), Architecture in the Digital Age: Design and Manufacturing, Spon Press, London, UK, 2003 Opas J, Bochnick H, Tuomi J, (1994), “Manufacturability Analysis as a Part of CAD/CAM Integration”, Intelligent Systems in Design and Manufacturing, 261-292 Rudolph S, Alber R, (2002), “An Evolutionary Approach to the Inverse Problem in Rule-Based Design Representations”, Artificial Intelligence in Design ’02, 329-350 Rich M, (1989), Digital Mockup, American Institute of Aeronautics and Astronautics, Reston, VA, 1989 Schön, D., The Reflective Practitioner: How Professional Think in Action. Basic Books. 1983 Shelden, D, (2003), “Digital Surface Representation and the Constructability of Gehry’s Architecture.” Diss. Massachusetts Institute of Technology, Cambridge, MA, 2003 Smithers T, Conkie A, Doheny J, Logan B, Millington K, (1989), “Design as Intelligent Behaviour: An AI in Design Thesis Programme”, Artificial Intelligence in Design, 293-334 Smithers T, (2002), “Synthesis in Designing”, Artificial Intelligence in Design ’02, 3-24 Stiny, G, (1977), “Ice-ray: a note on the generation of Chinese lattice designs” Environmental and Planning B, volume 4, pp. 89-98
keywords Digital fabrication; bilateral contouring; integral connection; complex-curve
series SIGRADI
email
last changed 2016/03/10 09:52

_id 22bd
authors Hoffmann, C.M., Hopcroft, J.E. and Karasick, M.S.
year 1989
title Robust Set Operations on Polyhedral Solids
source IEEE Computer Graphics and Applications. November, 1989. vol. 9: pp. 50-59 : ill. includes bibliography
summary The paper describes an algorithm for performing regularized Boolean operations on polyhedral solids. Robustness is achieved by adding symbolic reasoning as a supplemental step to resolve possible numerical uncertainty. Additionally, numerical redundancy and numerical computation based on derived quantities are reduced as much as possible. It also discusses the authors' experience with the implementation of the algorithm
keywords algorithms, polyhedra, solids, representation, computational geometry, geometric modeling, boolean operations
series CADline
last changed 2003/06/02 14:41

_id f4fb
authors Karasick, Michael
year 1989
title On the Representation and Manipulation of Rigid Solids
source McGill University, Department of Computer Science, Montreal
summary Solid modeling studies how to represent geometric properties of solids by computer. A fundamental operation is the construction of representations of solids. Algorithms for set operations construct boundary representations of solids from boundary representations of other solids. A correct and efficient intersection algorithm for polyhedral solids that uses boundary representations is described. A finite-precision implementation of the algorithm uses incidence tests that use symbolic inference in order to limit errors due to finite-precision approximations. The incidence tests are described and experimental evidence is presented to show that the incidence tests are both empirically reliable and practical. The intersection algorithm uses a new boundary representation called the Star-Edge representation. A complementation algorithm for solids that uses the new representation is given, and an algorithm is given that uses the new representation to determine if two boundary representations describe the same solid. A canonical boundary representation for solids is described and used to prove a lower bound for the same-object problem.
series thesis:PhD
email
last changed 2003/02/12 22:37

_id ed07
authors Love, James
year 1990
title A Case Study in Knowledge-Based System Development : Envelope Design for Reduction of Traffic Noise Transmission
source February, 1990. 19 p. : some ill. and table. includes a bibliography
summary Researchers have demonstrated the value of replication of research and explicit testing of concepts in artificial intelligence (Ritchie and Hanna 1989). In this study, a rule- based system was implemented as an exercise in the application of the theory and practice of knowledge-based systems development to architectural design analysis. The test domain was the selection of wall and window assemblies to provide adequate noise reduction given a set of traffic and building site conditions. This domain was chosen for two reasons: (1) considerable detailed heuristic information was available; and (2) it avoided large solutions spaces, 'errorful' and time-dependent data, and unreliable knowledge. Development of the system in conjunction with an extensive literature review revealed that publications on construction and performance of rule-based systems provided insufficient detail on key aspects of system architecture. Topics suffering from neglect or insufficiently rigorous treatment included algorithms used in automated inference, methods for selection of inference procedures, the integration of numerical and symbolic processing, the formulation of explanation mechanisms to deal with integrated numerical and symbolic processing, testing methods, and software standardization. Improving the quality and scope of knowledge in these areas is essential if expert systems are to be applied effectively in architectural design
keywords CAD, expert systems, acoustics, applications, knowledge base, design, architecture, AI, analysis
series CADline
last changed 1999/02/12 15:09

_id 7812
authors Straber, W. and Seidel, H.-P. (eds.)
year 1989
title Theory and Practice of Geometric Modeling
source Springer-Verlag
summary This book originates from the lectures given at the international conference "Theory and Practice of Geometric Modeling", Blaubeuren, FRG, October 3-7, 1988, that brought together leading experts from universities, system developers, and system users, to discuss new concepts and future trends in geometric modeling. The book covers a variety of topics on an advanced level and is organized as follows. Part A contains new algorithms and techniques for modeling objects that are bounded by free form surfaces. Part B focuses on surface/surface intersections, new types of blending surfaces and speed ups for ray tracing. Part C contains some new geometric tools. Part D discusses different representation schemes in solid modeling, conversions between these different schemes, and some applications. Part E covers some issues of product modeling, automatic tolerancing, high level specification of solid models (constraints, features) and the need for better user interfaces.
series other
last changed 2003/04/23 15:14

_id 2786
authors Woodwark, J.R.
year 1989
title Splitting Set-Theoretic Solid Models into Connected Components
source 10 p. : ill. Winchester: IBM UK Scientific Center, IBM United Kingdom Laboratories Limited, June, 1989. IBM UKSC 210. includes bibliography In general, there is no way to tell how many pieces (connected components) a set-theoretic (CSG) solid model represents, except via conversion to a boundary model. Recent work on the elimination of redundant primitives has been linked with techniques for identifying connected components in quad-trees and oct-trees into a strategy to attack this problem. Some success has been achieved, and an experimental Prolog program, working in two dimensions, that finds connected components and determines the set-theoretic representation of each component, is reported, and further developments proposed. CSG / quadtree / octree / primitives / algorithms. 43. Woodwark, J. R. and Quinlan K. M. 'Reducing the Effect of Complexity on Volume Model Evaluation.' Computer Aided Design. April, 1982. pp. 89-95 : ill. includes bibliography.
summary A major problem with volume modelling systems is that processing times may increase with model complexity in a worse than linear fashion. The authors have addressed this problem, for picture generation, by repeatedly dividing the space occupied by a model, and evaluating the sub-models created only when they meet a criterion of simplicity. Hidden surface elimination has been integrated with evaluation, in such a way that major portions of the model which are not visible are never evaluated. An example demonstrates a better than linear relationship between model complexity and computation time, and also shows the effect of picture complexity on the performance of the process
keywords CAD, computational geometry, solid modeling, geometric modeling, algorithms, hidden surfaces, CSG
series CADline
last changed 2003/06/02 13:58

No more hits.

HOMELOGIN (you are user _anon_310071 from group guest) CUMINCAD Papers Powered by SciX Open Publishing Services 1.002