Approximating smooth planar curves by arc splines
Journal of Computational and Applied Mathematics
Cyclides in computer aided geometric design II
Computer Aided Geometric Design
As-rigid-as-possible shape interpolation
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Algorithms on cone spline surfaces and spatial osculating arc splines
Computer Aided Geometric Design
Geometric modeling with conical meshes and developable surfaces
ACM SIGGRAPH 2006 Papers
Geometry of multi-layer freeform structures for architecture
ACM SIGGRAPH 2007 papers
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Freeform surfaces from single curved panels
ACM SIGGRAPH 2008 papers
Circular spline fitting using an evolution process
Journal of Computational and Applied Mathematics
Packing circles and spheres on surfaces
ACM SIGGRAPH Asia 2009 papers
Generalized Koebe's method for conformal mapping multiply connected domains
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
ACM SIGGRAPH 2010 papers
ACM SIGGRAPH 2010 papers
Paneling architectural freeform surfaces
ACM SIGGRAPH 2010 papers
Triangle surfaces with discrete equivalence classes
ACM SIGGRAPH 2010 papers
Darboux cyclides and webs from circles
Computer Aided Geometric Design
ACM Transactions on Graphics (TOG)
Smooth surfaces from rational bilinear patches
Computer Aided Geometric Design
Hi-index | 0.00 |
The most important guiding principle in computational methods for freeform architecture is the balance between cost efficiency on the one hand, and adherence to the design intent on the other. Key issues are the simplicity of supporting and connecting elements as well as repetition of costly parts. This paper proposes so-called circular arc structures as a means to faithfully realize freeform designs without giving up smooth appearance. In contrast to non-smooth meshes with straight edges where geometric complexity is concentrated in the nodes, we stay with smooth surfaces and rather distribute complexity in a uniform way by allowing edges in the shape of circular arcs. We are able to achieve the simplest possible shape of nodes without interfering with known panel optimization algorithms. We study remarkable special cases of circular arc structures which possess simple supporting elements or repetitive edges, we present the first global approximation method for principal patches, and we show an extension to volumetric structures for truly three-dimensional designs.