Abstract: The algorithms of convex hull have been extensively studied in literature, principally because of their wide range of applications in different areas. This article presents an efficient algorithm to construct approximate convex hull from a set of n points in the plane in O(n + k) time, where k is the approximation error control parameter. The proposed algorithm is suitable for applications preferred to reduce the computation time in exchange of accuracy level such as animation and interaction in computer graphics where rapid and real-time graphics rendering is indispensable.
Abstract: The paper outlines the relevance of computational
geometry within the design and production process of architecture.
Based on two case studies, the digital chain - from the initial formfinding
to the final realization of spatial concepts - is discussed in
relation to geometric principles. The association with the fascinating
complexity that can be found in nature and its underlying geometry
was the starting point for both projects presented in the paper. The
translation of abstract geometric principles into a three-dimensional
digital design model – realized in Rhinoceros – was followed by a
process of transformation and optimization of the initial shape that
integrated aesthetic, spatial and structural qualities as well as aspects
of material properties and conditions of production.