Computational Design for Landscape Architects

Name: Computational Design for Landscape Architects
Brand: Taylor & Francis Ltd
Price: 280.99 AUD
Availability: BackOrder

By: Brendan Harmon

Write A Review

Hardcover | 31 May 2024 | Edition Number 1

At a Glance

Hardcover
226 Pages

Dimensions(cm)
28.0 x 21.0 x 1.91

Hardcover

RRP $326.00

$280.99

14%OFF

or 4 interest-free payments of $70.25 with

or

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

This book is a guide to computational design for landscape architects replete with extensive tutorials. It introduces algorithmic approaches for modeling and designing landscapes. The aim of this book is to use algorithms to understand and design landscape as a generative system, i.e. to harness the processes that shape landscape to generate new forms. An algorithmic approach to design is gently introduced through visual programming with Grasshopper, before more advanced methods are taught in Python, a high-level programming language. Topics covered include parametric design, randomness and noise, waves and attractors, lidar, drone photogrammetry, point cloud modeling, terrain modeling, earthworks, digital fabrication, and more. The chapters include sections on theory, methods, and either visual programming or scripting. Online resources for the book include code and datasets so that readers can easily follow along and try out the methods presented. This book is a much-needed guide, both theoretical and practical, on computational design for students, educators, and practitioners of landscape architecture.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.