Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30063
A New Vision of Fractal Geometry with Triangulati on Algorithm

Authors: Yasser M. Abd El-Latif, Fatma S.Abousaleh, Daoud S. S.

Abstract:

L-system is a tool commonly used for modeling and simulating the growth of fractal plants. The aim of this paper is to join some problems of the computational geometry with the fractal geometry by using the L-system technique to generate fractal plant in 3D. L-system constructs the fractal structure by applying rewriting rules sequentially and this technique depends on recursion process with large number of iterations to get different shapes of 3D fractal plants. Instead, it was reiterated a specific number of iterations up to three iterations. The vertices generated from the last stage of the Lsystem rewriting process are used as input to the triangulation algorithm to construct the triangulation shape of these vertices. The resulting shapes can be used as covers for the architectural objects and in different computer graphics fields. The paper presents a gallery of triangulation forms which application in architecture creates an alternative for domes and other traditional types of roofs.

Keywords: Computational geometry, fractal geometry, L-system, triangulation.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1332780

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF

References:


[1] D. Hearn and M.P. Baker, Computer Graphics. C version, 2nd ed, CA: A Viacom Company Upper Saddle River, New Jersey 07458, 1997, pp. 362-363.
[2] P. Furmanek, "POLYHEDRAL COVERS BASED ON L-SYSTEM FRACTAL CONSTRUCTION," The Journal of Polish Society for Geometry and Engineering Graphics, vol. 14, 2004, pp. 40-47.
[3] From Wikipedia and the free encyclopedia, "Fractal". Online: http://en.wikipedia.org/wiki/Fractal
[4] S. Sarkar, "Introduction to Computation Geometry," Spring 2008. Online: http://figment.csee.usf.edu/~sarkar/ComputationalGeometry/
[5] A. Lindenmayer, "Mathematical models for cellular interaction in development," parts I and Π, Journal of Theoretical Biology, vol. 18, 1968, pp.280-315.
[6] P. Prusinkiewicz and A. Lindenmayer, The algorithmic beauty of plants. New York: Springer-Verlag, 1990, ch. 1.
[7] B. D. Farkas, N. Romanyshyn, and P. Clary, "L- Systems Construction Kit". Online: http://l3d.cs.colorado.edu/~ctg/classes/ttt2005/projectreports/Lsystemrep ort2.pdf
[8] T. Ijiri, S. Owada, and T. Igarashi, "The Sketch L-System: Global Control of Tree Modeling Using Free-form Strokes," Smart Graphics (2006), pp. 138-146.
[9] P. Buser, E. Tosan, and Y. Weinand, "Fractal Geometry and its applications in the field of construction," summer 2005. Online:http://fractals-ibois.epfl.ch/wiki/images/105c06_project_plan.pdf
[10] D. P. Dobkin, "Computational Geometry and Computer Graphics," in Proc. IEEE, vol. 80, Issue 9, Sep. 1992, pp. 1400 - 1411.
[11] S. Priester, "Delaunay Triangles," July 19, 2005. Online:http://www.codeguru.com/Cpp/data/mfc_database/misc/article.p hp/c8901/
[12] P. Bourke, "Triangulate Efficient Triangulation Algorithm Suitable for Terrain Modelling" or "An Algorithm for Interpolating Irregularly- Spaced Data with Applications in Terrain Modelling," presented at the 1989 Pan Pacific Computer Conference, Beijing, China.
[13] G. Leach, "Improving Worst-Case Optimal Delaunay Triangulation Algorithms," In 4th Canadian Conference on Computational Geometry, Canada, June 15, 1992.