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

_id caadria2014_170
id caadria2014_170
authors Beirão, José Nuno; André Chaszar and Ljiljana _avi_
year 2014
title Convex- and Solid-Void Models for Analysis and Classification of Public Spaces
source Rethinking Comprehensive Design: Speculative Counterculture, Proceedings of the 19th International Conference on Computer-Aided Architectural Design Research in Asia (CAADRIA 2014) / Kyoto 14-16 May 2014, pp. 253–262
summary In this paper a semiautomated morphological classification of urban space is addressed systematically by sorting through the volumetric shapes of public spaces represented as 3-dimensional convex and solid voids. The motivation of this approach comes from a frequent criticism of space syntax methods for lacking information on how buildings and terrain morphology influence the perception and use of public spaces in general and streets in particular. To solve this problem information on how façades relate with streets and especially information about the facades’ height should be considered essential to produce a richer and more accurate morphological analysis of street canyons and other open spaces. Parametric modelling of convex voids broadens the hitherto known concept of two-dimensional convex spaces considering surrounding facades’ height and topography as important inputs for volumetric representation of urban space. The method explores the analytic potentials of ‘convex voids’ and ‘solid voids’ in describing characteristics of open public spaces such as containment, openness, enclosure, and perceived enclosure, and using these metrics to analyse and classify urban open spaces.
keywords Open public space; convex voids; solid voids; user-guided feature recognition
series CAADRIA
email jnb@fa.ulisboa.pt
last changed 2014/04/22 08:23

_id ascaad2014_025
id ascaad2014_025
authors Elias-Ozkan, Soofia T. and Hatem Had?a
year 2014
title Teaching and Learning Building Performance Virtualisation
source Digital Crafting [7th International Conference Proceedings of the Arab Society for Computer Aided Architectural Design (ASCAAD 2014 / ISBN 978-603-90142-5-6], Jeddah (Kingdom of Saudi Arabia), 31 March - 3 April 2014, pp. 323-330
summary Building performance simulation tools have indeed eased the task of evaluating a building’s performance from the point of view of lighting design, heating and cooling loads, total energy loads, acoustic properties, natural lighting, ventilation, smoke and fire containment etc. However, to use these tools correctly, not only is theoretical knowledge required but also insight that can only be attained after substantial experience. For example, in order to evaluate the thermal performance alone, one needs to understand climatology, material properties, building physics, HVAC systems, internal and external gain factors, solar impacts, etc. to name a few. Hence, teaching students of Architecture how to use these tools, and also to interpret the results properly, is a tall order. This paper reports on insights gained through teaching courses on building performance simulations to graduate students in the Department of Architecture. The course content was varied each term and a different simulation software was used; namely: ECOTECT, Energy Plus and Design Builder. Data presented here will also contain feedback from the course students regarding the modelling process of the buildings, inputting the data, simulating their performance, and evaluating the results. Also, the difficulties faced during the various steps as well as the drawbacks of the tools will be discussed in depth.
series ASCAAD
email elias_ozkan@yahoo.com
last changed 2016/02/15 12:09

_id 8c27
authors Kalay, Yehuda E.
year 1982
title Determining the Spatial Containment of a Point in General Polyhedra
source Computer graphics and Image Processing. 1982. vol. 19: pp. 303-334 : ill. includes bibliography. See also criticism and improvements in Orlowski, Marian
summary Determining the inclusion of a point in volume-enclosing polyhedra (shapes) in 3D space is, in principle, the extension of the well-known problem of determining the inclusion of a point in a polygon in 2D space. However, the extra degree of freedom makes 3D point-polyhedron containment analysis much more difficult to solve than the 2D point polygon problem, mainly because of the nonsequential ordering of the shape elements, which requires global shape data to be applied for resolving special cases. Two general O(n) algorithms for solving the problem by reducing the 3D case into the solvable 2D case are presented. The first algorithm, denoted 'the projection method,' is applicable to any planar- faced polyhedron, reducing the dimensionality by employing parallel projection to generate planar images of the shape faces, together with an image of the point being tested for inclusion. The containment relationship of these images is used to increment a global parity-counter when appropriate, representing an abstraction for counting the intersections between the surface of the shape and a halfline extending from the point to infinity. An 'inside' relationship is established when the parity-count is odd. Special cases (coincidence of the halfline with edges or vertices of the shape) are resolved by eliminating the coincidental elements and re-projecting the merged faces. The second algorithm, denoted 'the intersection method,' is applicable to any well- formed shape, including curved-surfaced ones. It reduces the dimensionality by intersecting the polygonal trace of the shape surface at the plane of intersection, which is tested for containing the trace of the point in the plane, directly establishing the overall 3D containment relationship. A particular O(n) implementation of the 2D point-in-polygon inclusion algorithm, which is used for solving the problem once reduced in dimensionality, is also presented. The presentation is complemented by discussions of the problems associated with point-polyhedron relationship determination in general, and comparative analysis of the two particular algorithms presented
keywords geometric modeling, point inclusion, polygons, polyhedra, computational geometry, algorithms, search, B-rep
series CADline
email kalay@socrates.berkeley.edu
last changed 2003/06/02 08:24

_id 14ee
authors Lorenc, S.J., Handlon, B.E. and Bernold, Leonhard E.
year 2000
title Development of a robotic bridge maintenance system
source Automation in Construction 9 (3) (2000) pp. 251-258
summary This paper will expand on the Robotic Bridge Maintenance System (RBMS) developed by the Construction Automation and Robotics Laboratory (CARL) at North Carolina State University (NCSU). The system consists of a 4-dof robot, designed and built at NCSU, mounted on the end of a truck-mounted peeper crane. Additionally, a containment system is mounted in front of the robot to contain the toxic waste created by the removal of the lead-based paint from the bridge beams and trusses.
series journal paper
more http://www.elsevier.com/locate/autcon
last changed 2003/05/15 19:22

_id 57c7
authors Mathew, Paul
year 1996
title Integrated Energy Modeling for Computational Building Design Assistance
source Carnegie Mellon University, Department of Architecture
summary Insights into the importance of energy modeling in building design have not yet resulted in the sufficient and systematic use of modeling tools in practice. In recent years, there has been considerable discussion on the limitations of simulation tools, and there is a noteworthy consensus as to the nature of the contributing factors (material and time implications, problematic user-interfaces, inefficient data communication structures, poor integration with CAD systems, absence of 'active' design support). This thesis deals with three research questions that are especially pertinent to the quest for active, multi-aspect design and simulation environments: (1) The appropriateness and feasibility of a methodologically consistent performance modeling approach through the entire design process. (2) Strategies for a structurally 'seamless' containment of performance simulation within a computational design environment. (3) Technologies to facilitate dynamic and interactive performance-to-design mapping. At a paradigmatic level, this thesis critically examines the existing responses to each of these questions, and proposes alternative computational frameworks and technologies to overcome some of the system-immanent ('endogenous') limitations of the existing approaches. At an operational level, this thesis demonstrates the proposed solutions by implementing an active thermal simulation module (NOD
series thesis:PhD
email ujf@cmu.edu
last changed 2003/04/15 00:37

_id 3283
authors Suter,G., Mahdavi, A. and Kirshnamurti, R.
year 1999
title A Performance-inspired Building Representation for Computational Design
source Proceedings of the Eighth International Conference on Computer Aided Architectural Design Futures [ISBN 0-7923-8536-5] Atlanta, 7-8 June 1999, pp. 117-132
summary A building representation for integrated building performance simulation is described, which addresses several important issues. First, it captures informational requirements for detailed performance analysis and maintains geometric integrity. Second, it provides computational support for efficient spatial queries and convenient building model manipulation. Representational elements include partitioning and refinement rules, containment hierarchies and dimension constraints. These features provide for ease of manipulation, geometric variety and spatial queries and are illustrated with examples. The paper concludes with a discussion of the limitations of the representation.
keywords Performance Simulation, Constraint-based Design, Geometric Modeling
series CAAD Futures
email amahdavi@tuwien.ac.at
last changed 2006/11/07 06:22

No more hits.

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