Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 All Title Author Keywords Abstract
 Publish in OALib Journal ISSN: 2333-9721 APC: Only \$99

 Relative Articles Projections of random covering sets From fractal groups to fractal sets Intersections of moving fractal sets Quasi-fractal sets in space Angular Projections of Fractal Sets Covering Paths for Planar Point Sets On Covering Multi-granulation Fuzzy Rough Sets The Complexity of Computing Minimal Unidirectional Covering Sets An improved approach to attribute reduction with covering rough sets Covering by discrete and closed discrete sets More...
Physics  2012

# Anisotropic covering of fractal sets

 Full-Text   Cite this paper

Abstract:

We consider the optimal covering of fractal sets in a two-dimensional space using ellipses which become increasingly anisotropic as their size is reduced. If the semi-minor axis is \epsilon and the semi-major axis is \delta, we set \delta=\epsilon^\alpha, where 0<\alpha<1 is an exponent characterising the anisotropy of the covers. For point set fractals, in most cases we find that the number of points N which can be covered by an ellipse centred on any given point has expectation value < N > ~ \epsilon^\beta, where \beta is a generalised dimension. We investigate the function \beta(\alpha) numerically for various sets, showing that it may be different for sets which have the same fractal dimension.

Full-Text