<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="de">
		<id>http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Smooth_Self-Similar_Curves</id>
		<title>Smooth Self-Similar Curves - Versionsgeschichte</title>
		<link rel="self" type="application/atom+xml" href="http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Smooth_Self-Similar_Curves"/>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Smooth_Self-Similar_Curves&amp;action=history"/>
		<updated>2026-05-17T00:24:10Z</updated>
		<subtitle>Versionsgeschichte dieser Seite in de_evolutionary_art_org</subtitle>
		<generator>MediaWiki 1.27.4</generator>

	<entry>
		<id>http://de.evo-art.org/index.php?title=Smooth_Self-Similar_Curves&amp;diff=4000&amp;oldid=prev</id>
		<title>Gbachelier: Die Seite wurde neu angelegt: „  == Reference == Craig S. Kaplan: Smooth Self-Similar Curves. In: Bridges 2011. Pages 209–216   == DOI ==  == Abstract == I present a technique for …“</title>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Smooth_Self-Similar_Curves&amp;diff=4000&amp;oldid=prev"/>
				<updated>2015-01-29T12:00:54Z</updated>
		
		<summary type="html">&lt;p&gt;Die Seite wurde neu angelegt: „  == Reference == Craig S. Kaplan: &lt;a href=&quot;/index.php?title=Smooth_Self-Similar_Curves&quot; title=&quot;Smooth Self-Similar Curves&quot;&gt;Smooth Self-Similar Curves&lt;/a&gt;. In: &lt;a href=&quot;/index.php?title=Bridges_2011&quot; title=&quot;Bridges 2011&quot;&gt;Bridges 2011&lt;/a&gt;. Pages 209–216   == DOI ==  == Abstract == I present a technique for …“&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Neue Seite&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
&lt;br /&gt;
== Reference ==&lt;br /&gt;
Craig S. Kaplan: [[Smooth Self-Similar Curves]]. In: [[Bridges 2011]]. Pages 209–216 &lt;br /&gt;
&lt;br /&gt;
== DOI ==&lt;br /&gt;
&lt;br /&gt;
== Abstract ==&lt;br /&gt;
I present a technique for constructing self-similar curves from smooth base curves. The technique is similar to that used in&lt;br /&gt;
Iterated Function Systems like the Koch curve, except that it does not require a piecewise linear path in order to induce a set&lt;br /&gt;
of similarities. I explain the mathematical machinery behind the technique, describe a practical numerical approximation&lt;br /&gt;
that can be implemented in software, and show some results.&lt;br /&gt;
&lt;br /&gt;
== Extended Abstract ==&lt;br /&gt;
&lt;br /&gt;
== Bibtex == &lt;br /&gt;
&lt;br /&gt;
== Used References ==&lt;br /&gt;
[1] Michael F. Barnsley. Fractals Everywhere. Morgan Kauffman, second edition, 2000.&lt;br /&gt;
&lt;br /&gt;
[2] Adam Finkelstein and David H. Salesin. Multiresolution curves. In Proceedings of the 21st annual confer-&lt;br /&gt;
ence on Computer graphics and interactive techniques, SIGGRAPH ’94, pages 261–268. ACM, 1994.&lt;br /&gt;
&lt;br /&gt;
[3] Aaron Hertzmann, Nuria Oliver, Brian Curless, and Steven M. Seitz. Curve analogies. In Proceedings of the&lt;br /&gt;
13th Eurographics workshop on Rendering, EGRW ’02, pages 233–246. Eurographics Association, 2002.&lt;br /&gt;
&lt;br /&gt;
[4] Benoît B. Mandelbrot. The Fractal Geometry of Nature. Times Books, 1983.&lt;br /&gt;
&lt;br /&gt;
[5] Peter Shirley. Fundamentals of Computer Graphics. A K Peters, second edition, 2005.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Links ==&lt;br /&gt;
=== Full Text === &lt;br /&gt;
http://archive.bridgesmathart.org/2011/bridges2011-209.pdf&lt;br /&gt;
&lt;br /&gt;
[[intern file]]&lt;br /&gt;
&lt;br /&gt;
=== Sonstige Links ===&lt;br /&gt;
http://archive.bridgesmathart.org/2011/bridges2011-209.html&lt;/div&gt;</summary>
		<author><name>Gbachelier</name></author>	</entry>

	</feed>