Dnia Mon, 12 Sep 2011 07:45:42 +0000, Adam Majewski napisa?(a):
> Dnia Mon, 12 Sep 2011 05:45:06 -0400, Mario Rodriguez napisa?(a):
>
>> On 09/11/2011 08:00 PM, Mario Rodriguez wrote:
>>>
>>> Some of these lists are very long. You can try arrays instead. Graphic
>>> object 'points' can be used with lisp arrays. Type
>>>
>>> ? points
>>>
>>> for an example.
>>
>> List l11, for example, contains more than 200000 points. You don't need
>> to join them with segments, since plotting the isolated points shows a
>> continuous curve. Doing so, you can avoid sorting them, which is also
>> time consuming.
>
> Yes, they are dense on the curve.
>>
>> You can sort the short lists and plot them with points_joined = true,
>> and generate the long ones as arrays (I hope this will be faster) and
>> plot them without sorting and with points_joined = false.
>>
>> Another alternative is to extract from the long arrays a sample list of
>> points (between 200 and 300 could be enough), sort and plot them with
>> points_joined = true.
> Intresting. I will try it.
>>
>> By the way, due to the fractal nature of the figure, are you sure that
>> sorting the points with respect to their arguments returns a correct
>> ordering along the boundary of the Julia set? Certainly, I'd try to
>> plot the longest lists (or arrays) without sorting.
>
> Yes. Points should be ordered by external angle not argument !!!!! ( it
> will be time consuming)
> If argument of points of the circle is equall to its external angle then
> maybe I should keep it for other points ( preimages) for simple
> computation of external angle ?
>
>
> Thx
>
> Adam
>
>
> _______________________________________________ Maxima mailing list
> Maxima at math.utexas.edu
> http://www.math.utexas.edu/mailman/listinfo/maxima
Here is the result :
http://commons.wikimedia.org/wiki/File:Preimages_of_curve_ER.png
Regards
Adam