Sketches
Anti-Aliased Curve Algorithms
home top contents previous up next


Direct distance calculation from integer to curcles`s point
	* apparently: in PHP?, http://mapidev.blogspot.com/2008/10/xiaolin-wu-look-like-circle.html
	* apparently: in Pascal? http://forum.thegamecreators.com/?m=forum_view&t=171529&b=6
					WU-lemma used, but redundant

Non-categorized:
	* 
		Fast, Antialiased Circles and Ellipses from Xiaolin Wu’s concepts
		Filed under: Uncategorized — David Laurence Emerson @ 10:28 am 
		October 23, 2009
		http://yellowsplash.wordpress.com/2009/10/23/fast-antialiased-circles-and-ellipses-from-xiaolin-wus-concepts/
		
        *	Has a deep note about primary course: 
			"- if the slope is more horizontal then vertical, draw the line in a horizontal fashion, otherwise draw it in a vertical fashion."
		*	complex curves? 
		*   Delphi?

		Actually we already used this concept like in colde snippet from AAC.version 17:
				  if(course/2*2==course){
        	    	   right=(course+6)%8;
        	    	   rightX=T[right][0];
        	   		   rightY=T[right][1];
        		   }


? not clear why storing D(r,j) is faster then sqrt(r). From Google's book.


Copyright (C) 2011 Konstantin Kirillov. MIT License