Skip to Main content Skip to Navigation
New interface

Extension of algorithmic geometry to fractal structures

Abstract : Defining shapes by iteration allows us to generate new structures with specific properties (roughness,lacunarity), which cannot be achieved with classic modelling.For developing an iterative modeller to design fractals described by a BCIFS, we developed a set oftools and algorithms that permits one to evaluate, to characterize and to analyse different geometricproperties (localisation, convex hull, volume, fractal dimension) of fractals. We identified properties ofstandard CAD operations (intersection, union, offset, . . . ) allowing us to approximate them for fractalsand also to optimize these approximation algorithms.In some cases, it is possible to construct a CIFS with generalised HUTCHINSON operator, whoseattractor is close enough to the operation result with respect to the HAUSDORFF metric.We introduceda generic algorithm to compute such CIFS for a given accuracy.We defined the self-similarity propertyof the operation defining a set of transformations, which are used in the output iterative system.In order to construct an exact CIFS of the image, if it exists, we must prove all the necessarysimilarities manually. We explicit also the condition of the operation to be represented by an IFS witha generalised HUTCHINSON operator. In this case, only this condition should be proved manually
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Thursday, May 15, 2014 - 11:02:12 AM
Last modification on : Friday, August 5, 2022 - 2:54:00 PM
Long-term archiving on: : Friday, August 15, 2014 - 10:50:33 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00991384, version 1


Anton Mishkinis. Extension of algorithmic geometry to fractal structures. General Mathematics [math.GM]. Université de Bourgogne, 2013. English. ⟨NNT : 2013DIJOS049⟩. ⟨tel-00991384⟩



Record views


Files downloads