Difference between revisions of "Main Page"
m (→Projected topics) |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 12: | Line 12: | ||
[[tc|tc (C++ class)]] | [[tc|tc (C++ class)]] | ||
| + | |||
| + | [[Case studies]] | ||
== Projected topics == | == Projected topics == | ||
| Line 17: | Line 19: | ||
Coloring schemes. Personal credo: represent only necessary information. | Coloring schemes. Personal credo: represent only necessary information. | ||
| − | distance estimators: variations, using outside the world of iteration (holomorphic functions, Kleinian groups), smoothing (exp), generation based partitioning | + | [[distance estimator|distance estimators]]: variations, using outside the world of iteration (holomorphic functions, Kleinian groups), smoothing (exp), generation based partitioning |
tricks for parabolic points | tricks for parabolic points | ||
| Line 28: | Line 30: | ||
sample programs | sample programs | ||
| + | |||
| + | OpenGL trick for quick möbius map | ||
Latest revision as of 23:09, 18 December 2015
This sub-site of my webpage will host an explanation of different drawing techniques and algorithms I learnt, adapted, enhanced, or invented, to draw some objects in a few domains of mathematics, mainly 2D bitmap pictures in holomorphic dynamics, but not only.
Knowledge of complex numbers is an absolute pre-requisite.
Arnaud Cheritat (talk) 15:42, 25 February 2014 (CET)
Topics
General guidelines towards quality
Backward vs forward iteration methods
Projected topics
Coloring schemes. Personal credo: represent only necessary information.
distance estimators: variations, using outside the world of iteration (holomorphic functions, Kleinian groups), smoothing (exp), generation based partitioning
tricks for parabolic points
tricks for Siegel disks
the abysmal monster
fake 3d via normal mapping
sample programs
OpenGL trick for quick möbius map
