Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Circular arc structures
Bo P., Pottmann H., Kilian M., Wang W., Wallner J. ACM Transactions on Graphics (TOG)30 (4):1-12,2011.Type:Article
Date Reviewed: Feb 23 2012

A circular arc structure (CAS) is a mesh of a surface with edges realized by circular arcs, such that all edges incident to a vertex are tangent to a common plane, and form a repeatable pattern of angles about interior vertices so that all vertices are congruent. The goal is to approximate a free-form architectural design with repetitions of the costly parts, primarily the node and arc structures.

The CAS is computed by a nonlinear optimization of a “functional” that penalizes deviations from the multiple goals. A good initialization is crucial; a conformal mapping from a regular network (say, hexagonal) with the prescribed vertex angles provides it. We can avoid the torsion at nodes by following principal lines of curvature. We can augment the functional so that circular-arc edges all have the same radius; this is another cost savings.

A Möbius transformation preserves smoothness, angles, and circular arc-ness, and so provides geometric guidance for CASs. In particular, applying Möbius transformations to tori results in the so-called Dupin cyclides, and leads to cyclidic CASs with attractive properties. For example, the offset of a cyclidic patch is again cyclidic, which enables construction of structural elements with parallel glass panels.

A cyclidic CAS model may also be naturally converted to a developable strip model, which has manufacturing implications: we can form such strips by bending flat strips.

This paper is rich with ideas, emerging from the fruitful interaction of classical differential geometry, modern discrete geometry, numerical optimization, and architectural pragmatics. The 25 color figures are nothing short of stunning.

Reviewer:  Joseph O’Rourke Review #: CR139901 (1207-0738)
Bookmark and Share
  Featured Reviewer  
 
Geometric Algorithms, Languages, And Systems (I.3.5 ... )
 
 
Curve, Surface, Solid, And Object Representations (I.3.5 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Geometric Algorithms, Languages, And Systems": Date
Depth-order point classification techniques for CSG display algorithms
Jansen F. (ed) ACM Transactions on Graphics (TOG) 2(3): 40-70, 1983. Type: Article
Aug 1 1991
Oriented projective geometry
Stolfi J., Academic Press Prof., Inc., San Diego, CA, 1991. Type: Book (9780126720259)
Jul 1 1992
A linear time algorithm for computing the convex hull of an ordered crossing polygon
Ghosh S., Shyamasundar R. Pattern Recognition 17(3): 351-358, 1984. Type: Article
Jan 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy