World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SQUARE FRACTAL ALGORITHM

    https://doi.org/10.1142/S0218348X05002763Cited by:1 (Source: Crossref)

    Spanning a planar graph the way D. Hilbert's curve does has various image processing and industrial applications. Spanning a planar graph by two disjoint curves with fractal properties has even more scientific and industrial uses. For example, given two liquids and an active osmosis through membrane between them, we would like to both cool the liquids and to find a cost-effective structure for the osmosis to occur. Another equivalent problem is to expose two liquids to light that passes through a transparent slab as the osmosis between them occurs. Two disjoint curves can be the answer for the required structure. Differences of lengths between the curves can also be useful. A fractal structure is obvious in the lungs, where osmosis of oxygen is vital. Fractal structures are often found in organic osmotic processes in Nature. In this article, a method for spanning a planar graph by two disjoint curves will be presented.