AVOIDING INTERSECTIONS OF DRAGON CURVES

This article proves that there are no self-intersections in the dragon curve when the unfolding angle is greater than 98.195[Formula: see text]. This is shown by constructing a boundary for the dragon curve that is mapped onto itself by the generating mappings for the dragon curve. The treatment is purely geometric. The proof is supplemented by a conjecture that reduces the boundary for the unfolding angle to 96.241[Formula: see text].

Authors

Institutions

Publication Details

Journal
Fractals
Published
2025-10-31
DOI
https://doi.org/10.1142/s0218348x2650009x
Primary Topic
Geometric Analysis and Curvature Flows
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

AVOIDING INTERSECTIONS OF DRAGON CURVES

Zhiqi Guo, Heyu Guo, Reimund Albers
Fractals
Geometric Analysis and Curvature Flows
article

AVOIDING INTERSECTIONS OF DRAGON CURVES

Zhiqi Guo, Heyu Guo, Reimund Albers
article en

Abstract

This article proves that there are no self-intersections in the dragon curve when the unfolding angle is greater than 98.195[Formula: see text]. This is shown by constructing a boundary for the dragon curve that is mapped onto itself by the generating mappings for the dragon curve. The treatment is purely geometric. The proof is supplemented by a conjecture that reduces the boundary for the unfolding angle to 96.241[Formula: see text].

FractalsVol. 34(01)
University of Bremen (DE), Staats- und Universitätsbibliothek Bremen (DE)
Openalex Percentile: Top 56%
Geometric Analysis and Curvature Flows
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.