Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | FAQ
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2009, Vol. 24 Issue (1 ) :56-64     DOI:
Special Section on Digital Geometry and Mesh Processing Current Issue | Archive | Adv Search << Previous Articles | Next Articles >>
An Algorithm for Constructing 3D Struts
George W. Hart
Department of Computer Science, Stony Brook University, Stony Brook, NY 11794, U.S.A.

Related Articles
Download: [PDF 43967KB]     Export: BibTeX or EndNote (RIS)  
Abstract A simple robust "strut algorithm" is presented which, when given a graph embedded in 3D space, thickens its edges into solid struts. Various applications, crystallographic and sculptural, are shown in which smooth high-genus forms are the output. A toolbox of algorithmic techniques allow for a variety of novel, visually engaging forms that express a mathematical aesthetic. In sculptural examples, hyperbolic tessellations in the Poincar\'e plane are transformed in several ways to three-dimensional networks of edges embodied within a plausibly organic organization. By the use of different transformations and adjustable parameters in the algorithms, a variety of attractive forms result. The techniques produce watertight boundary representations that can be built with solid freeform fabrication equipment. The final physical output satisfies the "coolness criterion," that passers by will pick them up and say "Wow, that's cool!"
Articles by authors
George W. Hart
Keywordssculpture   solid modeling   echinoderm   algorithms   fine arts     
Received 2008-07-22; Revised 2009-01-10
Cite this article:   
George W. Hart.An Algorithm for Constructing 3D Struts[J]  Journal of Computer Science and Technology, 2009,V24(1 ): 56-64
Copyright 2010 by Journal of Computer Science and Technology