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

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

_id	caadria2008_41_session4b_335
id	caadria2008_41_session4b_335
authors	Biao, Li; Li Rong, Xue Kai, Liu Chang, Gao Qin
year	2008
title	A Generative Tool Base on Multi-Agent System: Algorithm of “HighFAR” and Its Computer Programming
doi	https://doi.org/10.52842/conf.caadria.2008.335
source	CAADRIA 2008 [Proceedings of the 13th International Conference on Computer Aided Architectural Design Research in Asia] Chiang Mai (Thailand) 9-12 April 2008, pp. 335-342
summary	Utilizing the principle of multi-agent system by computer programming, the paper presents achievement of an architectural generative design tool which implements intelligent architecture design with the focus of the layout in Asian high density “Floor Area Ratio” (FAR). Applying with the software, architects can get a high density FAR planning design in several minutes. From macroscopic position of building agents in geography to encode the agents by computer programming, the paper expounds the process of the generative tool and its mathematics algorithms.
keywords	Multi-agent system, FAR, genetic algorithm, generator
series	CAADRIA
email
last changed	2022/06/07 07:52

_id	acadia16_140
id	acadia16_140
authors	Nejur, Andrei; Steinfeld, Kyle
year	2016
title	Ivy: Bringing a Weighted-Mesh Representations to Bear on Generative Architectural Design Applications
doi	https://doi.org/10.52842/conf.acadia.2016.140
source	ACADIA // 2016: POSTHUMAN FRONTIERS: Data, Designers, and Cognitive Machines [Proceedings of the 36th Annual Conference of the Association for Computer Aided Design in Architecture (ACADIA) ISBN 978-0-692-77095-5] Ann Arbor 27-29 October, 2016, pp. 140-151
summary	Mesh segmentation has become an important and well-researched topic in computational geometry in recent years (Agathos et al. 2008). As a result, a number of new approaches have been developed that have led to innovations in a diverse set of problems in computer graphics (CG) (Sharmir 2008). Specifically, a range of effective methods for the division of a mesh have recently been proposed, including by K-means (Shlafman et al. 2002), graph cuts (Golovinskiy and Funkhouser 2008; Katz and Tal 2003), hierarchical clustering (Garland et al. 2001; Gelfand and Guibas 2004; Golovinskiy and Funkhouser 2008), primitive fitting (Athene et al. 2004), random walks (Lai et al.), core extraction (Katz et al.) tubular multi-scale analysis (Mortara et al. 2004), spectral clustering (Liu and Zhang 2004), and critical point analysis (Lin et al. 20070, all of which depend upon a weighted graph representation, typically the dual of a given mesh (Sharmir 2008). While these approaches have been proven effective within the narrowly defined domains of application for which they have been developed (Chen 2009), they have not been brought to bear on wider classes of problems in fields outside of CG, specifically on problems relevant to generative architectural design. Given the widespread use of meshes and the utility of segmentation in GAD, by surveying the relevant and recently matured approaches to mesh segmentation in CG that share a common representation of the mesh dual, this paper identifies and takes steps to address a heretofore unrealized transfer of technology that would resolve a missed opportunity for both subject areas. Meshes are often employed by architectural designers for purposes that are distinct from and present a unique set of requirements in relation to similar applications that have enjoyed more focused study in computer science. This paper presents a survey of similar applications, including thin-sheet fabrication (Mitani and Suzuki 2004), rendering optimization (Garland et al. 2001), 3D mesh compression (Taubin et al. 1998), morphin (Shapira et al. 2008) and mesh simplification (Kalvin and Taylor 1996), and distinguish the requirements of these applications from those presented by GAD, including non-refinement in advance of the constraining of mesh geometry to planar-quad faces, and the ability to address a diversity of mesh features that may or may not be preserved. Following this survey of existing approaches and unmet needs, the authors assert that if a generalized framework for working with graph representations of meshes is developed, allowing for the interactive adjustment of edge weights, then the recent developments in mesh segmentation may be better brought to bear on GAD problems. This paper presents work toward the development of just such a framework, implemented as a plug-in for the visual programming environment Grasshopper.
keywords	tool-building, design simulation, fabrication, computation, megalith
series	ACADIA
type	paper
email
last changed	2022/06/07 07:58

No more hits.