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

_{Feb}

_{Mar}

_{Apr}
(8) 
_{May}
(7) 
_{Jun}
(9) 
_{Jul}
(4) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}


2002 
_{Jan}
(1) 
_{Feb}
(1) 
_{Mar}
(4) 
_{Apr}
(6) 
_{May}
(17) 
_{Jun}
(1) 
_{Jul}
(2) 
_{Aug}
(2) 
_{Sep}
(3) 
_{Oct}
(21) 
_{Nov}
(6) 
_{Dec}
(4) 
2003 
_{Jan}
(2) 
_{Feb}
(5) 
_{Mar}

_{Apr}
(6) 
_{May}
(21) 
_{Jun}
(27) 
_{Jul}
(14) 
_{Aug}
(13) 
_{Sep}
(30) 
_{Oct}
(71) 
_{Nov}
(188) 
_{Dec}
(108) 
2004 
_{Jan}
(74) 
_{Feb}
(341) 
_{Mar}
(307) 
_{Apr}
(64) 
_{May}
(98) 
_{Jun}
(185) 
_{Jul}
(37) 
_{Aug}
(175) 
_{Sep}
(196) 
_{Oct}
(206) 
_{Nov}
(174) 
_{Dec}
(399) 
2005 
_{Jan}
(136) 
_{Feb}
(217) 
_{Mar}
(265) 
_{Apr}
(227) 
_{May}
(198) 
_{Jun}
(178) 
_{Jul}
(239) 
_{Aug}
(245) 
_{Sep}
(290) 
_{Oct}
(145) 
_{Nov}
(120) 
_{Dec}
(103) 
2006 
_{Jan}
(107) 
_{Feb}
(276) 
_{Mar}
(332) 
_{Apr}
(255) 
_{May}
(326) 
_{Jun}
(121) 
_{Jul}
(75) 
_{Aug}
(236) 
_{Sep}
(289) 
_{Oct}
(337) 
_{Nov}
(131) 
_{Dec}
(90) 
2007 
_{Jan}
(64) 
_{Feb}
(169) 
_{Mar}
(233) 
_{Apr}
(128) 
_{May}
(409) 
_{Jun}
(151) 
_{Jul}
(82) 
_{Aug}
(201) 
_{Sep}
(150) 
_{Oct}
(243) 
_{Nov}
(117) 
_{Dec}
(175) 
2008 
_{Jan}
(127) 
_{Feb}
(155) 
_{Mar}
(120) 
_{Apr}
(260) 
_{May}
(123) 
_{Jun}
(108) 
_{Jul}
(128) 
_{Aug}
(253) 
_{Sep}
(229) 
_{Oct}
(224) 
_{Nov}
(214) 
_{Dec}
(127) 
2009 
_{Jan}
(77) 
_{Feb}
(153) 
_{Mar}
(89) 
_{Apr}
(192) 
_{May}
(182) 
_{Jun}
(168) 
_{Jul}
(84) 
_{Aug}
(94) 
_{Sep}
(126) 
_{Oct}
(164) 
_{Nov}
(143) 
_{Dec}
(191) 
2010 
_{Jan}
(236) 
_{Feb}
(249) 
_{Mar}
(212) 
_{Apr}
(286) 
_{May}
(198) 
_{Jun}
(208) 
_{Jul}
(446) 
_{Aug}
(291) 
_{Sep}
(241) 
_{Oct}
(217) 
_{Nov}
(286) 
_{Dec}
(120) 
2011 
_{Jan}
(141) 
_{Feb}
(127) 
_{Mar}
(247) 
_{Apr}
(182) 
_{May}
(159) 
_{Jun}
(124) 
_{Jul}
(193) 
_{Aug}
(161) 
_{Sep}
(267) 
_{Oct}
(171) 
_{Nov}
(205) 
_{Dec}
(85) 
2012 
_{Jan}
(135) 
_{Feb}
(72) 
_{Mar}
(128) 
_{Apr}
(202) 
_{May}
(144) 
_{Jun}
(219) 
_{Jul}
(169) 
_{Aug}
(71) 
_{Sep}
(99) 
_{Oct}
(118) 
_{Nov}
(306) 
_{Dec}
(140) 
2013 
_{Jan}
(220) 
_{Feb}
(220) 
_{Mar}
(305) 
_{Apr}
(123) 
_{May}
(189) 
_{Jun}
(135) 
_{Jul}
(81) 
_{Aug}
(187) 
_{Sep}
(281) 
_{Oct}
(150) 
_{Nov}
(332) 
_{Dec}
(179) 
2014 
_{Jan}
(274) 
_{Feb}
(253) 
_{Mar}
(164) 
_{Apr}
(196) 
_{May}
(111) 
_{Jun}
(237) 
_{Jul}
(146) 
_{Aug}
(120) 
_{Sep}
(263) 
_{Oct}
(151) 
_{Nov}
(109) 
_{Dec}
(87) 
2015 
_{Jan}
(202) 
_{Feb}
(121) 
_{Mar}
(101) 
_{Apr}
(77) 
_{May}
(91) 
_{Jun}
(124) 
_{Jul}
(71) 
_{Aug}
(206) 
_{Sep}
(140) 
_{Oct}
(147) 
_{Nov}
(119) 
_{Dec}
(164) 
2016 
_{Jan}
(175) 
_{Feb}
(77) 
_{Mar}
(162) 
_{Apr}
(104) 
_{May}
(137) 
_{Jun}
(126) 
_{Jul}
(102) 
_{Aug}
(55) 
_{Sep}
(53) 
_{Oct}
(63) 
_{Nov}
(8) 
_{Dec}
(41) 
2017 
_{Jan}
(40) 
_{Feb}
(20) 
_{Mar}
(53) 
_{Apr}
(98) 
_{May}
(34) 
_{Jun}
(61) 
_{Jul}
(46) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 







1
(2) 
2

3
(3) 
4
(3) 
5
(5) 
6
(7) 
7
(5) 
8
(19) 
9
(9) 
10
(5) 
11
(1) 
12
(11) 
13
(9) 
14
(3) 
15

16

17
(5) 
18

19
(1) 
20
(26) 
21
(7) 
22

23

24

25
(12) 
26

27
(1) 
28
(2) 
29

30

31






From: <drc@ma...>  20050117 17:11:34

Hi, I=92ve just finished an update to iBabel, This is an Applescript Studio app= lication that=20 provides a frontend for a variety of Cheminformatics tools. To date these = include=20 file conversion, SMARTS searching, overlaying using OpenBabel, a 2D viewer = using=20 JChempaint, a 3D molecule viewer using Jmol. As an alternative Marvin can b= e=20 used for both 2D and 3D display. A detailed description can be found here: http://www.macinchem.fsnet.co.uk/iBabel.pdf The application can be found here: http://ww.macinchem.fsnet.co.uk/Public.sit Neither of these links is available from the website yet, since I=92d appre= ciate any=20 feedback before doing so. It requires MacOSX, but if you don=92t have access you can always read the = manual=20 and see what you are missing ? Chris =20 Whatever you Wanadoo: http://www.wanadoo.co.uk/time/ This email has been checked for most known viruses  find out more at: http= ://www.wanadoo.co.uk/help/id/7098.htm 
From: Nicolas Vervelle <nvervell@cl...>  20050117 05:50:45

I think :  A point is part of the plane P if : (x  xC) * xN + (y  yC) * yN + (z  zC) * zN = 0  A point is part of the line going through Q and perpendicular to P if it exists n so that : (x  xQ) = n * xN and (y  yQ) = n * yN and (z  zQ) = n * zN. So to find n : (n * xN + xQ  xC) * xN + ... = 0 And then (x, y, z). Hope my gemetry is still good (long time ago) and it helps Nicolas  Original Message  From: "Miguel" <miguel@...> To: <jmolusers@...> Sent: Monday, January 17, 2005 4:41 AM Subject: [Jmolusers] 3D geometry help needed I need help solving a 3D geometry problem. Detail ====== I have a plane P defined by a point C and normal vector N. (I also have a vector that lies in the plane, if that is useful) On the plane is a circle centered at point C with radius R. I have another point Q that is at an arbitrary point in 3space (probably off of the plane P, but perhaps lying in the plane). I need to find the point on the circle that is the farthest from Q. My thinking is as follows: 1. find the point on the plane P that is closest to Q, call it Pq 2. create a vector from Pq to C 3. normalize that vector 4. scale the vector by the radius R 5. add the vector to C Q: Is my approach OK, or is there a better way to solve this problem? I can do steps 2 through 5 ... but I do not know how to do step 1. Q: Given a plane defined by a point and a vector (either normal or in the plane), how do I find the point Pq in the plane that is closest to a point Q that may or may not be off of the plane? Thanks, Miguel  The SF.Net email is sponsored by: Beat the postholiday blues Get a FREE limited edition SourceForge.net tshirt from ThinkGeek. It's fun and FREE  well, almost....http://www.thinkgeek.com/sfshirt _______________________________________________ Jmolusers mailing list Jmolusers@... https://lists.sourceforge.net/lists/listinfo/jmolusers 
From: Warren DeLano <warren@de...>  20050117 04:36:42

Miguel, Not sure this is the most efficient, but it should work: 1. subtract Q from C to get D. 2. project D onto N to get E. 3. add E to D to get a vector F that runs from Pq to C. 4. normalize F. 5. scale F by R. 6. add F to C to get the point you want. Cheers, Warren  Warren L. DeLano, Ph.D. Principal Scientist . DeLano Scientific LLC . 400 Oyster Point Blvd., Suite 213 . South San Francisco, CA 94080 . Biz:(650)8720942 Tech:(650)8720834 . Fax:(650)8720273 Cell:(650)3461154 . mailto:warren@... > Original Message > From: jmolusersadmin@... > [mailto:jmolusersadmin@...] On Behalf Of Miguel > Sent: Sunday, January 16, 2005 7:41 PM > To: jmolusers@... > Subject: [Jmolusers] 3D geometry help needed > > I need help solving a 3D geometry problem. > > Detail > ====== > > I have a plane P defined by a point C and normal vector N. (I > also have a vector that lies in the plane, if that is useful) > On the plane is a circle centered at point C with radius R. > > I have another point Q that is at an arbitrary point in > 3space (probably off of the plane P, but perhaps lying in > the plane). I need to find the point on the circle that is > the farthest from Q. > > My thinking is as follows: > > 1. find the point on the plane P that is closest to Q, call > it Pq 2. create a vector from Pq to C 3. normalize that > vector 4. scale the vector by the radius R 5. add the vector to C > > Q: Is my approach OK, or is there a better way to solve this problem? > > > I can do steps 2 through 5 ... but I do not know how to do step 1. > > Q: Given a plane defined by a point and a vector (either > normal or in the plane), how do I find the point Pq in the > plane that is closest to a point Q that may or may not be off > of the plane? > > > > Thanks, > Miguel > > > > > >  > The SF.Net email is sponsored by: Beat the postholiday blues > Get a FREE limited edition SourceForge.net tshirt from ThinkGeek. > It's fun and FREE  well, almost....http://www.thinkgeek.com/sfshirt > _______________________________________________ > Jmolusers mailing list > Jmolusers@... > https://lists.sourceforge.net/lists/listinfo/jmolusers > 
From: Warren DeLano <warren@de...>  20050117 04:36:36

Miguel, Not sure this is the most efficient, but it should work: 1. subtract Q from C to get D. 2. project D onto N to get E. 3. add E to D to get a vector F that runs from Pq to C. 4. normalize F. 5. scale F by R. 6. add F to C to get the point you want. Cheers, Warren  Warren L. DeLano, Ph.D. Principal Scientist . DeLano Scientific LLC . 400 Oyster Point Blvd., Suite 213 . South San Francisco, CA 94080 . Biz:(650)8720942 Tech:(650)8720834 . Fax:(650)8720273 Cell:(650)3461154 . mailto:warren@... > Original Message > From: jmolusersadmin@... > [mailto:jmolusersadmin@...] On Behalf Of Miguel > Sent: Sunday, January 16, 2005 7:41 PM > To: jmolusers@... > Subject: [Jmolusers] 3D geometry help needed > > I need help solving a 3D geometry problem. > > Detail > ====== > > I have a plane P defined by a point C and normal vector N. (I > also have a vector that lies in the plane, if that is useful) > On the plane is a circle centered at point C with radius R. > > I have another point Q that is at an arbitrary point in > 3space (probably off of the plane P, but perhaps lying in > the plane). I need to find the point on the circle that is > the farthest from Q. > > My thinking is as follows: > > 1. find the point on the plane P that is closest to Q, call > it Pq 2. create a vector from Pq to C 3. normalize that > vector 4. scale the vector by the radius R 5. add the vector to C > > Q: Is my approach OK, or is there a better way to solve this problem? > > > I can do steps 2 through 5 ... but I do not know how to do step 1. > > Q: Given a plane defined by a point and a vector (either > normal or in the plane), how do I find the point Pq in the > plane that is closest to a point Q that may or may not be off > of the plane? > > > > Thanks, > Miguel > > > > > >  > The SF.Net email is sponsored by: Beat the postholiday blues > Get a FREE limited edition SourceForge.net tshirt from ThinkGeek. > It's fun and FREE  well, almost....http://www.thinkgeek.com/sfshirt > _______________________________________________ > Jmolusers mailing list > Jmolusers@... > https://lists.sourceforge.net/lists/listinfo/jmolusers > 
From: Miguel <miguel@jm...>  20050117 03:41:38

I need help solving a 3D geometry problem. Detail =3D=3D=3D=3D=3D=3D I have a plane P defined by a point C and normal vector N. (I also have a= vector that lies in the plane, if that is useful) On the plane is a circl= e centered at point C with radius R. I have another point Q that is at an arbitrary point in 3space (probably= off of the plane P, but perhaps lying in the plane). I need to find the point on the circle that is the farthest from Q. My thinking is as follows: 1. find the point on the plane P that is closest to Q, call it Pq 2. create a vector from Pq to C 3. normalize that vector 4. scale the vector by the radius R 5. add the vector to C Q: Is my approach OK, or is there a better way to solve this problem? I can do steps 2 through 5 ... but I do not know how to do step 1. Q: Given a plane defined by a point and a vector (either normal or in the= plane), how do I find the point Pq in the plane that is closest to a poin= t Q that may or may not be off of the plane? Thanks, Miguel 