<?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=Warping_Pictures_Nicely</id>
		<title>Warping Pictures Nicely - Versionsgeschichte</title>
		<link rel="self" type="application/atom+xml" href="http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Warping_Pictures_Nicely"/>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Warping_Pictures_Nicely&amp;action=history"/>
		<updated>2026-05-17T01:41:32Z</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=Warping_Pictures_Nicely&amp;diff=4005&amp;oldid=prev</id>
		<title>Gbachelier: Die Seite wurde neu angelegt: „  == Reference == David Swart: Warping Pictures Nicely. In: Bridges 2011. Pages 303–310   == DOI ==  == Abstract == We present a new algorithm, using…“</title>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Warping_Pictures_Nicely&amp;diff=4005&amp;oldid=prev"/>
				<updated>2015-01-29T15:07:26Z</updated>
		
		<summary type="html">&lt;p&gt;Die Seite wurde neu angelegt: „  == Reference == David Swart: &lt;a href=&quot;/index.php?title=Warping_Pictures_Nicely&quot; title=&quot;Warping Pictures Nicely&quot;&gt;Warping Pictures Nicely&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 303–310   == DOI ==  == Abstract == We present a new algorithm, using…“&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;
David Swart: [[Warping Pictures Nicely]]. In: [[Bridges 2011]]. Pages 303–310 &lt;br /&gt;
&lt;br /&gt;
== DOI ==&lt;br /&gt;
&lt;br /&gt;
== Abstract ==&lt;br /&gt;
We present a new algorithm, using only simple geometry, to warp imagery from an arbitrarily shaped source region&lt;br /&gt;
to an arbitrarily shaped target region. Mathematically speaking, the algorithm outputs harmonic maps (every point&lt;br /&gt;
is at the average position of its neighbors) using new boundary conditions to curb excessive non-uniform stretching&lt;br /&gt;
and shearing in order to appear more conformal. The algorithm has typical running times measured in seconds. We&lt;br /&gt;
give some artistic examples to demonstrate how the results can be used in digital photography and other graphical&lt;br /&gt;
work.&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] Vladimir Bulatov. Conformal Models of the Hyperbolic Geometry. Presented at MAA-AMS Joint Mathematics&lt;br /&gt;
Meeting, San Francisco 2010. http://bulatov.org/math/1001/. Accessed February 1, 2011.&lt;br /&gt;
&lt;br /&gt;
[2] Chuck Collins and Kenneth Stephenson. A Circle Packing Algorithm. Computational Geometry: Theory and&lt;br /&gt;
Applications, vol. 25, pages 233–256, 2003.&lt;br /&gt;
&lt;br /&gt;
[3] Bart de Smit and Hendrik W. Lenstra Jr. The Mathematical Structure of Escher’s Print Gallery. In Notices of the&lt;br /&gt;
AMS 50, no 4, pages 446–451, 2003.&lt;br /&gt;
&lt;br /&gt;
[4] Tobin A. Driscoll and Lloyd N. Trefethen. Schwarz-Christoffel Mapping. Cambridge Monographs on Applied&lt;br /&gt;
and Computational Mathematics, 2002.&lt;br /&gt;
&lt;br /&gt;
[5] Daniel M. Germán, Lloyd Burchill, Alexandre Duret-Lutz, Sébastien Pérez-Duarte, Emmanuel Pérez-Duarte,&lt;br /&gt;
Josh Sommers. Flattening the Viewable Sphere. Computational Aesthetics 2007, pages 23–28. 2007.&lt;br /&gt;
&lt;br /&gt;
[6] Owen Jones. The Grammar of Ornament. Folio edition, Bernard Quaritch, 1910.&lt;br /&gt;
&lt;br /&gt;
[7] Liliya Kharevych, Boris Springborn and Peter Schröder. Discrete Conformal Mappings via Circle Patterns. In&lt;br /&gt;
ACM Transactions on Graphics 25(2), pages 412-438, 2006&lt;br /&gt;
&lt;br /&gt;
[8] Boris Springborn, P. Schröder, and Ulrich Pinkall. Conformal Equivalence of Triangle Meshes. In ACM&lt;br /&gt;
Transactions on Graphics, 27(3), article 77, 2008.&lt;br /&gt;
&lt;br /&gt;
[9] Martin von Gagern and Jürgen Richter-Gebert. Hyperbolization of Euclidean Ornaments. The Electronic&lt;br /&gt;
Journal of Combinatorics, 16(2), 2009.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Links ==&lt;br /&gt;
=== Full Text === &lt;br /&gt;
http://archive.bridgesmathart.org/2011/bridges2011-303.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-303.html&lt;/div&gt;</summary>
		<author><name>Gbachelier</name></author>	</entry>

	</feed>