T. Martyn, The attractor-wrapping approach to approximating convex hulls of 2D affine IFS attractors, Computers & Graphics, vol.33, issue.1, pp.104-112, 2009.
DOI : 10.1016/j.cag.2008.08.003

R. S. Strichartz and Y. Wang, Geometry of selfaffine tiles I, Indiana University Mathematics Journal, vol.48, pp.1-23, 1999.

R. Kenyon, J. Li, R. S. Strichartz, and Y. Wang, Geometry of self-affine tiles II, Indiana University Mathematics Journal, vol.48, pp.25-42, 1999.

O. S. Lawlor and J. C. Hart, Bounding recursive procedural models using convex optimization, 11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings., pp.283-292, 2003.
DOI : 10.1109/PCCGA.2003.1238270
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.5318

J. Duda, Analysis of the convex hull of the attractor of an IFS, 2008.

T. Martyn, Realistic rendering 3D IFS fractals in real-time with graphics accelerators, Computers & Graphics, vol.34, issue.2, pp.167-175, 2010.
DOI : 10.1016/j.cag.2009.10.001

J. C. Hart and T. A. Defanti, Efficient antialiased rendering of 3-D linear fractals, ACM SIGGRAPH Computer Graphics, vol.25, issue.4, pp.91-100, 1991.
DOI : 10.1145/127719.122728

J. Rice, Spatial bounding of self-affine iterated function system attractor sets, Graphics interface GI'96, pp.107-122, 1996.

T. Martyn, Tight bounding ball for affine IFS attractor The smallest enclosing disc of an affine IFS fractal, Computers & Graphics Fractals. Complex Geometry, Patterns, and Scaling in Nature and Society, vol.27, issue.173, pp.535-552, 2003.

S. J. Kim, D. Y. Lee, and M. Y. Yang, Offset Triangular Mesh Using the Multiple Normal Vectors of a Vertex, Computer-Aided Design and Applications, vol.9, issue.3, 2004.
DOI : 10.1080/16864360.2004.10738269

D. J. Yoo, General 3D offsetting of a triangular net using an implicit function and the distance fields, International Journal of Precision Engineering and Manufacturing, vol.223, issue.Issue2, pp.131-142, 2009.
DOI : 10.1007/s12541-009-0081-5

T. Chan, Optimal output-sensitive convex hull algorithms in two and three dimensions, Discrete & Computational Geometry, vol.6, issue.4, pp.361-368, 1996.
DOI : 10.1007/BF02712873

J. A. Nelder and R. Mead, A Simplex Method for Function Minimization, The Computer Journal, vol.7, issue.4, pp.308-313, 1965.
DOI : 10.1093/comjnl/7.4.308
URL : http://comjnl.oxfordjournals.org/cgi/content/short/7/4/308

D. Canright, Estimating the spatial extent of attractors of iterated function systems, Computers & Graphics, vol.18, issue.2, pp.231-238, 1994.
DOI : 10.1016/0097-8493(94)90098-1

Y. He, Y. He, and H. Li, Fast and accurate determination of the spatial boundary of IFS attractors, Computers & Graphics, vol.23, issue.4, pp.547-553, 1999.
DOI : 10.1016/S0097-8493(99)00073-4