Shortest path fractal dimension for randomly crumpled thin paper sheets | Zendy

Hugo David Sánchez Chávez | Zendy; Leonardo Flores Cano | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Shortest path fractal dimension for randomly crumpled thin paper sheets

Author(s) -

Hugo David Sánchez Chávez,

Leonardo Flores Cano

Publication year - 2018

Publication title -

revista mexicana de física

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.181

H-Index - 25

eISSN - 2683-2224

pISSN - 0035-001X

DOI - 10.31349/revmexfis.64.415

Subject(s) - fractal dimension , fractal , shortest path problem , percolation (cognitive psychology) , dimension (graph theory) , path (computing) , fractal dimension on networks , mathematics , mathematical analysis , geometry , combinatorics , statistical physics , physics , fractal analysis , computer science , graph , neuroscience , biology , programming language

We realized a study of the shortest path fractal dimension in three dimensions for randomly crumpled paper balls. We took measurements between all possible combinations of pairs of points in crumpled and flat configurations, we found that a correlation between these distances exist, even more, such mean experimental value is dmin=1.2953±0.02 that coincides almost numerically with the very known 3D shortest path fractal dimension for percolation systems reported in computational simulations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research