You can subscribe to this list here.
2003 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}
(1) 
_{Nov}
(33) 
_{Dec}
(20) 

2004 
_{Jan}
(7) 
_{Feb}
(44) 
_{Mar}
(51) 
_{Apr}
(43) 
_{May}
(43) 
_{Jun}
(36) 
_{Jul}
(61) 
_{Aug}
(44) 
_{Sep}
(25) 
_{Oct}
(82) 
_{Nov}
(97) 
_{Dec}
(47) 
2005 
_{Jan}
(77) 
_{Feb}
(143) 
_{Mar}
(42) 
_{Apr}
(31) 
_{May}
(93) 
_{Jun}
(93) 
_{Jul}
(35) 
_{Aug}
(78) 
_{Sep}
(56) 
_{Oct}
(44) 
_{Nov}
(72) 
_{Dec}
(75) 
2006 
_{Jan}
(116) 
_{Feb}
(99) 
_{Mar}
(181) 
_{Apr}
(171) 
_{May}
(112) 
_{Jun}
(86) 
_{Jul}
(91) 
_{Aug}
(111) 
_{Sep}
(77) 
_{Oct}
(72) 
_{Nov}
(57) 
_{Dec}
(51) 
2007 
_{Jan}
(64) 
_{Feb}
(116) 
_{Mar}
(70) 
_{Apr}
(74) 
_{May}
(53) 
_{Jun}
(40) 
_{Jul}
(519) 
_{Aug}
(151) 
_{Sep}
(132) 
_{Oct}
(74) 
_{Nov}
(282) 
_{Dec}
(190) 
2008 
_{Jan}
(141) 
_{Feb}
(67) 
_{Mar}
(69) 
_{Apr}
(96) 
_{May}
(227) 
_{Jun}
(404) 
_{Jul}
(399) 
_{Aug}
(96) 
_{Sep}
(120) 
_{Oct}
(205) 
_{Nov}
(126) 
_{Dec}
(261) 
2009 
_{Jan}
(136) 
_{Feb}
(136) 
_{Mar}
(119) 
_{Apr}
(124) 
_{May}
(155) 
_{Jun}
(98) 
_{Jul}
(136) 
_{Aug}
(292) 
_{Sep}
(174) 
_{Oct}
(126) 
_{Nov}
(126) 
_{Dec}
(79) 
2010 
_{Jan}
(109) 
_{Feb}
(83) 
_{Mar}
(139) 
_{Apr}
(91) 
_{May}
(79) 
_{Jun}
(164) 
_{Jul}
(184) 
_{Aug}
(146) 
_{Sep}
(163) 
_{Oct}
(128) 
_{Nov}
(70) 
_{Dec}
(73) 
2011 
_{Jan}
(235) 
_{Feb}
(165) 
_{Mar}
(147) 
_{Apr}
(86) 
_{May}
(74) 
_{Jun}
(118) 
_{Jul}
(65) 
_{Aug}
(75) 
_{Sep}
(162) 
_{Oct}
(94) 
_{Nov}
(48) 
_{Dec}
(44) 
2012 
_{Jan}
(49) 
_{Feb}
(40) 
_{Mar}
(88) 
_{Apr}
(35) 
_{May}
(52) 
_{Jun}
(69) 
_{Jul}
(90) 
_{Aug}
(123) 
_{Sep}
(112) 
_{Oct}
(120) 
_{Nov}
(105) 
_{Dec}
(116) 
2013 
_{Jan}
(76) 
_{Feb}
(26) 
_{Mar}
(78) 
_{Apr}
(43) 
_{May}
(61) 
_{Jun}
(53) 
_{Jul}
(147) 
_{Aug}
(85) 
_{Sep}
(83) 
_{Oct}
(122) 
_{Nov}
(18) 
_{Dec}
(27) 
2014 
_{Jan}
(58) 
_{Feb}
(25) 
_{Mar}
(49) 
_{Apr}
(17) 
_{May}
(29) 
_{Jun}
(39) 
_{Jul}
(53) 
_{Aug}
(52) 
_{Sep}
(35) 
_{Oct}
(47) 
_{Nov}

_{Dec}

S  M  T  W  T  F  S 







1
(3) 
2
(3) 
3
(26) 
4
(12) 
5
(17) 
6
(20) 
7

8
(2) 
9
(2) 
10
(15) 
11
(10) 
12
(21) 
13
(20) 
14
(8) 
15
(6) 
16
(6) 
17
(3) 
18
(2) 
19
(1) 
20
(2) 
21
(4) 
22

23

24

25
(1) 
26
(3) 
27
(1) 
28

29

30
(2) 
31






From: Michael Droettboom <mdroe@st...>  20071220 18:47:26

Porting this back to the trunk is nontrivial  but I know John would like to do it, so I think it will happen once one of us has time. As an aside, the unit stuff *should* be working on the branch. Can you send me a minimal example that shows it failing? Cheers, Mike James Evans wrote: > I have taken the transforms branch and played with it a bit and my super simple ellipse test cases appeared to be working great. I > couldn't run our more intensive tests since they use unitized data and I was getting errors that looked like the transforms branch > wasn't completely handling unitized data properly. It would be great if we could see this fix in the main branch, then we can make > use of it right away without having to wait for the transforms branch to be completed. > > James Evans > > >> Date: Tue, 11 Dec 2007 15:47:45 0500 >> From: Michael Droettboom <mdroe@...> >> Subject: Re: [matplotlibdevel] Problem with Agg Ellipses >> To: Ted Drain <ted.drain@...> >> Cc: matplotlib development list >> <matplotlibdevel@...> >> MessageID: <475EF771.3090805@...> >> ContentType: text/plain; charset="iso88591" >> >> And an actually interesting part of the plot... ;) >> >> Michael Droettboom wrote: >>> Sorry  correct attachment this time. >>> >>> Michael Droettboom wrote: >>>> I have a working draft of something that may work for this problem on >>>> the transforms branch. I am happy to backport this to the trunk, but >>>> that will require some effort, as the implementation relies on many of >>>> the new geometric utilities on the branch that would also have to be >>>> brought over. It may be some time until the branch is ready for >>>> production use, but if you are able to use it to experiment with this >>>> approach to this specific problem, that would certainly make my life >>>> easier, so I don't have to do the backporting work more than once. >>>> >>>> Attached is a plot comparing the new approach (above) vs. a 750edge >>>> polygonal approximation for the ellipses (based directly on James >>>> Evans' example). Here's a description of what it does: >>>> >>>> >>>> Ellipses are normally drawn using an approximation that uses >>>> eight cubic bezier splines. The error of this approximation >>>> is 1.89818e6, according to this unverified source: >>>> >>>> Lancaster, Don. Approximating a Circle or an Ellipse Using >>>> Four Bezier Cubic Splines. >>>> >>>> http://www.tinaja.com/glib/ellipse4.pdf >>>> >>>> There is a use case where very large ellipses must be drawn >>>> with very high accuracy, and it is too expensive to render the >>>> entire ellipse with enough segments (either splines or line >>>> segments). Therefore, in the case where either radius of the >>>> ellipse is large enough that the error of the spline >>>> approximation will be visible (greater than one pixel offset >>>> from the ideal), a different technique is used. >>>> >>>> In that case, only the visible parts of the ellipse are drawn, >>>> with each visible arc using a fixed number of spline segments >>>> (8). The algorithm proceeds as follows: >>>> >>>> 1. The points where the ellipse intersects the axes bounding >>>> box are located. (This is done be performing an inverse >>>> transformation on the axes bbox such that it is relative to >>>> the unit circle  this makes the intersection calculation >>>> much easier than doing rotated ellipse intersection >>>> directly). >>>> >>>> This uses the "line intersecting a circle" algorithm from: >>>> >>>> Vince, John. Geometry for Computer Graphics: Formulae, >>>> Examples & Proofs. London: SpringerVerlag, 2005. >>>> >>>> 2. The angles of each of the intersection points are >>>> calculated. >>>> >>>> 3. Proceeding counterclockwise starting in the positive >>>> xdirection, each of the visible arcsegments between the >>>> pairs of vertices are drawn using the bezier arc >>>> approximation technique implemented in Path.arc(). >>>> >>>> >>>> Cheers, >>>> Mike >>>> >>>> >>>> Ted Drain wrote: >>>>> All of these sound like good ideas to me. Just for some history: the >>>>> original reason we worked w/ John to get an Ellipse primitive in (vs >>>>> a normal line plot of sampled points) were to: >>>>>  improve ellipse plotting speeds (we plot a LOT of them at once) >>>>>  improve post script output >>>>> >>>>> Ted >>>>> >>>>> At 08:53 AM 12/10/2007, Michael Droettboom wrote: >>>>>> John Hunter wrote: >>>>>>> On Dec 10, 2007 10:25 AM, Ted Drain <ted.drain@...> wrote: >>>>>>> >>>>>>>> I don't know if the current MPL architecture can support this but it >>>>>>>> would be nice if it worked that way. We have people making decisions >>>>>>>> based on what these plots show that affect spacecraft worth hundreds >>>>>>>> of millions of dollars so it's important that we're plotting >>>>>> things accurately. >>>>>>> We can support this, but I think we would do this with an arc class >>>>>>> rather than an ellipse class, and write a special case class that is >>>>>>> viewlim aware. >>>>>> I agree  I think there are two uses cases for ellipse that are in >>>>>> conflict here. One is these large ellipses, the other is for things >>>>>> like scatter plots, where speed and file size is more important than >>>>>> accuracy. My mind was probably stuck on the latter as I've worked >>>>>> along >>>>>> the transforms branch. >>>>>> >>>>>>> A simple example of a line that has analogous >>>>>>> behavior is examples/clippedline.py, which clips the points outside >>>>>>> the viewport and draws in a different style according to the >>>>>>> resolution of the viewlim. The reason I think it would be preferable >>>>>>> to use an arc here is because we won't have to worry about filling the >>>>>>> thing when we only approximate a section of it. You could feed in a >>>>>>> 360 degree elliptical arc and then zoom into a portion of it. >>>>>>> >>>>>>> With the 8 point ellipse as is, and the addition of an arc class that >>>>>>> does 4 or 8 point approximation within the zoom limits, should that >>>>>>> serve your requirements? >>>>>> As a possible starting point, the transforms branch already has >>>>>> arcapproximationbycubicbezierspline code. It determines the >>>>>> number >>>>>> of splines to use based on the radians included in the arc, which is >>>>>> clearly not what we want here. But it should be reasonably >>>>>> straightforward to make that some fixed number and draw the arc between >>>>>> the edges of the axes. Or, alternatively, (and maybe this is what John >>>>>> is suggesting), the arc could be approximated by line segments (with >>>>>> the >>>>>> number of segments something like the number of pixels across the >>>>>> axes). >>>>>> To my naive mind, that seems more verifiable  or at least it puts >>>>>> the responsibility of getting this right all in one place. >>>>>> >>>>>> IMHO, these spline approximation tricks are all just with the aim of >>>>>> pushing curve rendering deeper into the backends for speed and file >>>>>> size >>>>>> improvements. But obviously there needs to be a way around it when it >>>>>> matters. >>>>>> >>>>>> Cheers, >>>>>> Mike >>>>>> >>>>>>  >>>>>> Michael Droettboom >>>>>> Science Software Branch >>>>>> Operations and Engineering Division >>>>>> Space Telescope Science Institute >>>>>> Operated by AURA for NASA >>>>>> >>>>>>  >>>>>> >>>>>> SF.Net email is sponsored by: >>>>>> Check out the new SourceForge.net Marketplace. >>>>>> It's the best place to buy or sell services for >>>>>> just about anything Open Source. >>>>>> http://sourceforge.net/services/buy/index.php >>>>>> _______________________________________________ >>>>>> Matplotlibdevel mailing list >>>>>> Matplotlibdevel@... >>>>>> https://lists.sourceforge.net/lists/listinfo/matplotlibdevel >>>>> Ted Drain Jet Propulsion Laboratory ted.drain@... >>>>> >>>>>  >>>>> >>>>> SF.Net email is sponsored by: Check out the new SourceForge.net >>>>> Marketplace. >>>>> It's the best place to buy or sell services for >>>>> just about anything Open Source. >>>>> http://sourceforge.net/services/buy/index.php >>>>> _______________________________________________ >>>>> Matplotlibdevel mailing list >>>>> Matplotlibdevel@... >>>>> https://lists.sourceforge.net/lists/listinfo/matplotlibdevel >>>> >>>>  >>>> >>>> >>>>  >>>> >>>>  >>>> SF.Net email is sponsored by: Check out the new SourceForge.net >>>> Marketplace. >>>> It's the best place to buy or sell services for >>>> just about anything Open Source. >>>> http://sourceforge.net/services/buy/index.php >>>> >>>> >>>>  >>>> >>>> _______________________________________________ >>>> Matplotlibdevel mailing list >>>> Matplotlibdevel@... >>>> https://lists.sourceforge.net/lists/listinfo/matplotlibdevel >>> >>>  >>> >>> >>>  >>> >>>  >>> SF.Net email is sponsored by: >>> Check out the new SourceForge.net Marketplace. >>> It's the best place to buy or sell services for >>> just about anything Open Source. >>> http://sourceforge.net/services/buy/index.php >>> >>> >>>  >>> >>> _______________________________________________ >>> Matplotlibdevel mailing list >>> Matplotlibdevel@... >>> https://lists.sourceforge.net/lists/listinfo/matplotlibdevel >>  >> Michael Droettboom >> Science Software Branch >> Operations and Engineering Division >> Space Telescope Science Institute >> Operated by AURA for NASA >>  next part  >> A nontext attachment was scrubbed... >> Name: ellipse.png >> Type: image/png >> Size: 49913 bytes >> Desc: not available >> >>  >> >>  >> SF.Net email is sponsored by: >> Check out the new SourceForge.net Marketplace. >> It's the best place to buy or sell services for >> just about anything Open Source. >> http://sourceforge.net/services/buy/index.php >> >>  >> >> _______________________________________________ >> Matplotlibdevel mailing list >> Matplotlibdevel@... >> https://lists.sourceforge.net/lists/listinfo/matplotlibdevel >> >> >> End of Matplotlibdevel Digest, Vol 19, Issue 16 >> ************************************************ > > >  > This SF.net email is sponsored by: Microsoft > Defy all challenges. Microsoft(R) Visual Studio 2005. > http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ > _______________________________________________ > Matplotlibdevel mailing list > Matplotlibdevel@... > https://lists.sourceforge.net/lists/listinfo/matplotlibdevel  Michael Droettboom Science Software Branch Operations and Engineering Division Space Telescope Science Institute Operated by AURA for NASA 
From: James Evans <jrevans1@ea...>  20071220 18:24:23

I have taken the transforms branch and played with it a bit and my super simple ellipse test cases appeared to be working great. I couldn't run our more intensive tests since they use unitized data and I was getting errors that looked like the transforms branch wasn't completely handling unitized data properly. It would be great if we could see this fix in the main branch, then we can make use of it right away without having to wait for the transforms branch to be completed. James Evans > Date: Tue, 11 Dec 2007 15:47:45 0500 > From: Michael Droettboom <mdroe@...> > Subject: Re: [matplotlibdevel] Problem with Agg Ellipses > To: Ted Drain <ted.drain@...> > Cc: matplotlib development list > <matplotlibdevel@...> > MessageID: <475EF771.3090805@...> > ContentType: text/plain; charset="iso88591" > > And an actually interesting part of the plot... ;) > > Michael Droettboom wrote: > > Sorry  correct attachment this time. > > > > Michael Droettboom wrote: > >> I have a working draft of something that may work for this problem on > >> the transforms branch. I am happy to backport this to the trunk, but > >> that will require some effort, as the implementation relies on many of > >> the new geometric utilities on the branch that would also have to be > >> brought over. It may be some time until the branch is ready for > >> production use, but if you are able to use it to experiment with this > >> approach to this specific problem, that would certainly make my life > >> easier, so I don't have to do the backporting work more than once. > >> > >> Attached is a plot comparing the new approach (above) vs. a 750edge > >> polygonal approximation for the ellipses (based directly on James > >> Evans' example). Here's a description of what it does: > >> > >> > >> Ellipses are normally drawn using an approximation that uses > >> eight cubic bezier splines. The error of this approximation > >> is 1.89818e6, according to this unverified source: > >> > >> Lancaster, Don. Approximating a Circle or an Ellipse Using > >> Four Bezier Cubic Splines. > >> > >> http://www.tinaja.com/glib/ellipse4.pdf > >> > >> There is a use case where very large ellipses must be drawn > >> with very high accuracy, and it is too expensive to render the > >> entire ellipse with enough segments (either splines or line > >> segments). Therefore, in the case where either radius of the > >> ellipse is large enough that the error of the spline > >> approximation will be visible (greater than one pixel offset > >> from the ideal), a different technique is used. > >> > >> In that case, only the visible parts of the ellipse are drawn, > >> with each visible arc using a fixed number of spline segments > >> (8). The algorithm proceeds as follows: > >> > >> 1. The points where the ellipse intersects the axes bounding > >> box are located. (This is done be performing an inverse > >> transformation on the axes bbox such that it is relative to > >> the unit circle  this makes the intersection calculation > >> much easier than doing rotated ellipse intersection > >> directly). > >> > >> This uses the "line intersecting a circle" algorithm from: > >> > >> Vince, John. Geometry for Computer Graphics: Formulae, > >> Examples & Proofs. London: SpringerVerlag, 2005. > >> > >> 2. The angles of each of the intersection points are > >> calculated. > >> > >> 3. Proceeding counterclockwise starting in the positive > >> xdirection, each of the visible arcsegments between the > >> pairs of vertices are drawn using the bezier arc > >> approximation technique implemented in Path.arc(). > >> > >> > >> Cheers, > >> Mike > >> > >> > >> Ted Drain wrote: > >>> All of these sound like good ideas to me. Just for some history: the > >>> original reason we worked w/ John to get an Ellipse primitive in (vs > >>> a normal line plot of sampled points) were to: > >>>  improve ellipse plotting speeds (we plot a LOT of them at once) > >>>  improve post script output > >>> > >>> Ted > >>> > >>> At 08:53 AM 12/10/2007, Michael Droettboom wrote: > >>>> John Hunter wrote: > >>>>> On Dec 10, 2007 10:25 AM, Ted Drain <ted.drain@...> wrote: > >>>>> > >>>>>> I don't know if the current MPL architecture can support this but it > >>>>>> would be nice if it worked that way. We have people making decisions > >>>>>> based on what these plots show that affect spacecraft worth hundreds > >>>>>> of millions of dollars so it's important that we're plotting > >>>> things accurately. > >>>>> We can support this, but I think we would do this with an arc class > >>>>> rather than an ellipse class, and write a special case class that is > >>>>> viewlim aware. > >>>> I agree  I think there are two uses cases for ellipse that are in > >>>> conflict here. One is these large ellipses, the other is for things > >>>> like scatter plots, where speed and file size is more important than > >>>> accuracy. My mind was probably stuck on the latter as I've worked > >>>> along > >>>> the transforms branch. > >>>> > >>>>> A simple example of a line that has analogous > >>>>> behavior is examples/clippedline.py, which clips the points outside > >>>>> the viewport and draws in a different style according to the > >>>>> resolution of the viewlim. The reason I think it would be preferable > >>>>> to use an arc here is because we won't have to worry about filling the > >>>>> thing when we only approximate a section of it. You could feed in a > >>>>> 360 degree elliptical arc and then zoom into a portion of it. > >>>>> > >>>>> With the 8 point ellipse as is, and the addition of an arc class that > >>>>> does 4 or 8 point approximation within the zoom limits, should that > >>>>> serve your requirements? > >>>> As a possible starting point, the transforms branch already has > >>>> arcapproximationbycubicbezierspline code. It determines the > >>>> number > >>>> of splines to use based on the radians included in the arc, which is > >>>> clearly not what we want here. But it should be reasonably > >>>> straightforward to make that some fixed number and draw the arc between > >>>> the edges of the axes. Or, alternatively, (and maybe this is what John > >>>> is suggesting), the arc could be approximated by line segments (with > >>>> the > >>>> number of segments something like the number of pixels across the > >>>> axes). > >>>> To my naive mind, that seems more verifiable  or at least it puts > >>>> the responsibility of getting this right all in one place. > >>>> > >>>> IMHO, these spline approximation tricks are all just with the aim of > >>>> pushing curve rendering deeper into the backends for speed and file > >>>> size > >>>> improvements. But obviously there needs to be a way around it when it > >>>> matters. > >>>> > >>>> Cheers, > >>>> Mike > >>>> > >>>>  > >>>> Michael Droettboom > >>>> Science Software Branch > >>>> Operations and Engineering Division > >>>> Space Telescope Science Institute > >>>> Operated by AURA for NASA > >>>> > >>>>  > >>>> > >>>> SF.Net email is sponsored by: > >>>> Check out the new SourceForge.net Marketplace. > >>>> It's the best place to buy or sell services for > >>>> just about anything Open Source. > >>>> http://sourceforge.net/services/buy/index.php > >>>> _______________________________________________ > >>>> Matplotlibdevel mailing list > >>>> Matplotlibdevel@... > >>>> https://lists.sourceforge.net/lists/listinfo/matplotlibdevel > >>> > >>> Ted Drain Jet Propulsion Laboratory ted.drain@... > >>> > >>>  > >>> > >>> SF.Net email is sponsored by: Check out the new SourceForge.net > >>> Marketplace. > >>> It's the best place to buy or sell services for > >>> just about anything Open Source. > >>> http://sourceforge.net/services/buy/index.php > >>> _______________________________________________ > >>> Matplotlibdevel mailing list > >>> Matplotlibdevel@... > >>> https://lists.sourceforge.net/lists/listinfo/matplotlibdevel > >> > >> > >>  > >> > >> > >>  > >> > >>  > >> SF.Net email is sponsored by: Check out the new SourceForge.net > >> Marketplace. > >> It's the best place to buy or sell services for > >> just about anything Open Source. > >> http://sourceforge.net/services/buy/index.php > >> > >> > >>  > >> > >> _______________________________________________ > >> Matplotlibdevel mailing list > >> Matplotlibdevel@... > >> https://lists.sourceforge.net/lists/listinfo/matplotlibdevel > > > > > >  > > > > > >  > > > >  > > SF.Net email is sponsored by: > > Check out the new SourceForge.net Marketplace. > > It's the best place to buy or sell services for > > just about anything Open Source. > > http://sourceforge.net/services/buy/index.php > > > > > >  > > > > _______________________________________________ > > Matplotlibdevel mailing list > > Matplotlibdevel@... > > https://lists.sourceforge.net/lists/listinfo/matplotlibdevel > >  > Michael Droettboom > Science Software Branch > Operations and Engineering Division > Space Telescope Science Institute > Operated by AURA for NASA >  next part  > A nontext attachment was scrubbed... > Name: ellipse.png > Type: image/png > Size: 49913 bytes > Desc: not available > >  > >  > SF.Net email is sponsored by: > Check out the new SourceForge.net Marketplace. > It's the best place to buy or sell services for > just about anything Open Source. > http://sourceforge.net/services/buy/index.php > >  > > _______________________________________________ > Matplotlibdevel mailing list > Matplotlibdevel@... > https://lists.sourceforge.net/lists/listinfo/matplotlibdevel > > > End of Matplotlibdevel Digest, Vol 19, Issue 16 > ************************************************ 