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

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(390) 
_{Aug}
(767) 
_{Sep}
(940) 
_{Oct}
(964) 
_{Nov}
(819) 
_{Dec}
(762) 

2001 
_{Jan}
(680) 
_{Feb}
(1075) 
_{Mar}
(954) 
_{Apr}
(595) 
_{May}
(725) 
_{Jun}
(868) 
_{Jul}
(678) 
_{Aug}
(785) 
_{Sep}
(410) 
_{Oct}
(395) 
_{Nov}
(374) 
_{Dec}
(419) 
2002 
_{Jan}
(699) 
_{Feb}
(501) 
_{Mar}
(311) 
_{Apr}
(334) 
_{May}
(501) 
_{Jun}
(507) 
_{Jul}
(441) 
_{Aug}
(395) 
_{Sep}
(540) 
_{Oct}
(416) 
_{Nov}
(369) 
_{Dec}
(373) 
2003 
_{Jan}
(514) 
_{Feb}
(488) 
_{Mar}
(396) 
_{Apr}
(624) 
_{May}
(590) 
_{Jun}
(562) 
_{Jul}
(546) 
_{Aug}
(463) 
_{Sep}
(389) 
_{Oct}
(399) 
_{Nov}
(333) 
_{Dec}
(449) 
2004 
_{Jan}
(317) 
_{Feb}
(395) 
_{Mar}
(136) 
_{Apr}
(338) 
_{May}
(488) 
_{Jun}
(306) 
_{Jul}
(266) 
_{Aug}
(424) 
_{Sep}
(502) 
_{Oct}
(170) 
_{Nov}
(170) 
_{Dec}
(134) 
2005 
_{Jan}
(249) 
_{Feb}
(109) 
_{Mar}
(119) 
_{Apr}
(282) 
_{May}
(82) 
_{Jun}
(113) 
_{Jul}
(56) 
_{Aug}
(160) 
_{Sep}
(89) 
_{Oct}
(98) 
_{Nov}
(237) 
_{Dec}
(297) 
2006 
_{Jan}
(151) 
_{Feb}
(250) 
_{Mar}
(222) 
_{Apr}
(147) 
_{May}
(266) 
_{Jun}
(313) 
_{Jul}
(367) 
_{Aug}
(135) 
_{Sep}
(108) 
_{Oct}
(110) 
_{Nov}
(220) 
_{Dec}
(47) 
2007 
_{Jan}
(133) 
_{Feb}
(144) 
_{Mar}
(247) 
_{Apr}
(191) 
_{May}
(191) 
_{Jun}
(171) 
_{Jul}
(160) 
_{Aug}
(51) 
_{Sep}
(125) 
_{Oct}
(115) 
_{Nov}
(78) 
_{Dec}
(67) 
2008 
_{Jan}
(165) 
_{Feb}
(37) 
_{Mar}
(130) 
_{Apr}
(111) 
_{May}
(91) 
_{Jun}
(142) 
_{Jul}
(54) 
_{Aug}
(104) 
_{Sep}
(89) 
_{Oct}
(87) 
_{Nov}
(44) 
_{Dec}
(54) 
2009 
_{Jan}
(283) 
_{Feb}
(113) 
_{Mar}
(154) 
_{Apr}
(395) 
_{May}
(62) 
_{Jun}
(48) 
_{Jul}
(52) 
_{Aug}
(54) 
_{Sep}
(131) 
_{Oct}
(29) 
_{Nov}
(32) 
_{Dec}
(37) 
2010 
_{Jan}
(34) 
_{Feb}
(36) 
_{Mar}
(40) 
_{Apr}
(23) 
_{May}
(38) 
_{Jun}
(34) 
_{Jul}
(36) 
_{Aug}
(27) 
_{Sep}
(9) 
_{Oct}
(18) 
_{Nov}
(25) 
_{Dec}

2011 
_{Jan}
(1) 
_{Feb}
(14) 
_{Mar}
(1) 
_{Apr}
(5) 
_{May}
(1) 
_{Jun}

_{Jul}

_{Aug}
(37) 
_{Sep}
(6) 
_{Oct}
(2) 
_{Nov}

_{Dec}

2012 
_{Jan}

_{Feb}
(7) 
_{Mar}

_{Apr}
(4) 
_{May}

_{Jun}
(3) 
_{Jul}

_{Aug}

_{Sep}
(1) 
_{Oct}

_{Nov}

_{Dec}
(10) 
2013 
_{Jan}

_{Feb}
(1) 
_{Mar}
(7) 
_{Apr}
(2) 
_{May}

_{Jun}

_{Jul}
(9) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

2014 
_{Jan}
(14) 
_{Feb}

_{Mar}
(2) 
_{Apr}

_{May}
(10) 
_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}
(3) 
_{Dec}

2015 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}
(12) 
_{Nov}

_{Dec}
(1) 
2016 
_{Jan}

_{Feb}
(1) 
_{Mar}
(1) 
_{Apr}
(1) 
_{May}

_{Jun}
(1) 
_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 






1

2

3

4
(2) 
5
(10) 
6
(10) 
7
(11) 
8

9

10
(1) 
11

12

13

14

15

16

17

18

19
(1) 
20
(2) 
21
(2) 
22
(5) 
23
(1) 
24
(3) 
25
(4) 
26
(3) 
27
(1) 
28
(5) 
29
(1) 
30

31







From: Emil Persson <humus@co...>  20090522 18:28:31

I'm tired and I have a headache, but if I understand your problem right then it sounds like a special case of a problem I just solved last night and wrote a tool for: http://www.humus.name/index.php?page=News <http://www.humus.name/index.php?page=News&ID=266>; &ID=266 So you'd just input your polygon directly (instead of inputting a particle texture and generate a polygon from that) and optimize for 4 vertices and that would solve it, no? Emil From: Stefan.Daenzer@... [mailto:Stefan.Daenzer@...] Sent: 22 May 2009 14:59 To: Game Development Algorithms Subject: [Algorithms] Best fit of polygon inside another polygon Hi, I've been thinking about an algorithm which fits a given polygon into a quad. I've stumbled upon this while trying to fit the largest possible polygon out of a set of different polygons into a quadliteral. What I want to find is the bestfitpolygon which can be contained completely in the quadliteral. The polygon and quad can be assumed to be convex. An nice feature would be to calculate the error as a function of the area which doesn't fit into the quad for every polygon I throw at the quad. I'm working in 2D right now, but might want to expand the problem for a later application into a 3D case (fit a polyhedra into a hexahedron). Any ideas how to solve this problem? Stefan 
From: Robin Green <robin.green@gm...>  20090522 17:33:41

On Fri, May 22, 2009 at 8:41 AM, Peter Lipson <peter@...> wrote: > sounds like a question from one of my takehome final exams.... > > Welcome to the world of R&D, where it's like taking an exam every day of the week. Only there are no right answers, no scores at the end, and it's not clear whether the question is even possible.  R. 
From: Peter Lipson <peter@to...>  20090522 16:08:17

sounds like a question from one of my takehome final exams.... Stefan.Daenzer@... wrote: > Hi, > > I've been thinking about an algorithm which fits a given polygon into > a quad. I've stumbled upon this while trying to fit the largest > possible polygon out of a set of different polygons into a > quadliteral. What I want to find is the bestfitpolygon which can be > contained completely in the quadliteral. The polygon and quad can be > assumed to be convex. An nice feature would be to calculate the error > as a function of the area which doesn't fit into the quad for every > polygon I throw at the quad. > > I'm working in 2D right now, but might want to expand the problem for > a later application into a 3D case (fit a polyhedra into a hexahedron). > > Any ideas how to solve this problem? > > Stefan >  > >  > Register Now for Creativity and Technology (CaT), June 3rd, NYC. CaT > is a gathering of techside developers & brand creativity professionals. Meet > the minds behind Google Creative Lab, Visual Complexity, Processing, & > iPhoneDevCamp asthey present alongside digital heavyweights like Barbarian > Group, R/GA, & Big Spaceship. http://www.creativitycat.com >  > > _______________________________________________ > GDAlgorithmslist mailing list > GDAlgorithmslist@... > https://lists.sourceforge.net/lists/listinfo/gdalgorithmslist > Archives: > http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithmslist 
From: Fabian Giesen <f.giesen@49...>  20090522 13:15:13

Stefan.Daenzer@... wrote: > Hi, > > I've been thinking about an algorithm which fits a given polygon into a > quad. I've stumbled upon this while trying to fit the largest possible > polygon out of a set of different polygons into a quadliteral. What I > want to find is the bestfitpolygon which can be contained completely > in the quadliteral. The polygon and quad can be assumed to be convex. An > nice feature would be to calculate the error as a function of the area > which doesn't fit into the quad for every polygon I throw at the quad. > > I'm working in 2D right now, but might want to expand the problem for a > later application into a 3D case (fit a polyhedra into a hexahedron). > > Any ideas how to solve this problem? > > Stefan Which transformations are allowed? "Only translations", "translations and rotations", "translations, rotations and uniform scaling" and "general affine transformation" are all sensible choices but lead to very different approaches. Also, is the quad a general convex quad, or is it a rectangle or parallelogram? Kind regards, Fabian Giesen 
From: Stefan.D<aenzer@gm...>  20090522 12:58:57

Hi, I've been thinking about an algorithm which fits a given polygon into a quad. I've stumbled upon this while trying to fit the largest possible polygon out of a set of different polygons into a quadliteral. What I want to find is the bestfitpolygon which can be contained completely in the quadliteral. The polygon and quad can be assumed to be convex. An nice feature would be to calculate the error as a function of the area which doesn't fit into the quad for every polygon I throw at the quad. I'm working in 2D right now, but might want to expand the problem for a later application into a 3D case (fit a polyhedra into a hexahedron). Any ideas how to solve this problem? Stefan 