Difference between revisions of "Main Page"

From Techniques for computer generated pictures in complex dynamics
Jump to: navigation, search
(Projected topics to be discussed)
m (Projected topics)
 
(6 intermediate revisions by the same user not shown)
Line 1: Line 1:
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 holomorphic dynamics.
+
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 [http://en.wikipedia.org/wiki/Complex_numbers complex numbers] is an absolute pre-requisite.
 
Knowledge of [http://en.wikipedia.org/wiki/Complex_numbers complex numbers] is an absolute pre-requisite.
Line 5: Line 5:
 
[[User:Arnaud Cheritat|Arnaud Cheritat]] ([[User talk:Arnaud Cheritat|talk]]) 15:42, 25 February 2014 (CET)
 
[[User:Arnaud Cheritat|Arnaud Cheritat]] ([[User talk:Arnaud Cheritat|talk]]) 15:42, 25 February 2014 (CET)
  
== Projected topics to be discussed ==
+
== Topics ==
  
 
[[Guidelines|General guidelines towards quality]]
 
[[Guidelines|General guidelines towards quality]]
  
Backward vs forward iteration methods
+
[[Approaches|Backward vs forward iteration methods]]
  
Coloring schemes. Personal credo: represent only necessary information.
+
[[tc|tc (C++ class)]]
  
distance estimators: variations, using outside the world of iteration (holomorphic functions, Kleinian groups), smoothing (exp), generation based partitioning
+
[[Case studies]]
  
tc (C++ class)
+
== Projected topics ==
 +
 
 +
Coloring schemes. Personal credo: represent only necessary information.
 +
 
 +
[[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 26: 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

tc (C++ class)

Case studies

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