home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #27 / NN_1992_27.iso / spool / comp / graphics / 12216 < prev    next >
Encoding:
Text File  |  1992-11-22  |  970 b   |  22 lines
  1. Newsgroups: comp.graphics
  2. Path: sparky!uunet!news.smith.edu!orourke
  3. From: orourke@sophia.smith.edu (Joseph O'Rourke)
  4. Subject: Re: Shortest distance between two line _segments_
  5. Message-ID: <1992Nov22.112142.24512@sophia.smith.edu>
  6. Organization: Smith College, Northampton, MA, US
  7. References: <1992Nov21.000527.21786@zip.eecs.umich.edu> <By2z4D.How@slipknot.rain.com>
  8. Date: Sun, 22 Nov 1992 11:21:42 GMT
  9. Lines: 11
  10.  
  11. In article <By2z4D.How@slipknot.rain.com> robert@slipknot.rain.com.UUCP (Robert Reed) writes:
  12. >In article <1992Nov21.000527.21786@zip.eecs.umich.edu> katkere@engin.umich.edu writes:
  13. >|
  14. >|The problem I am trying to solve is whether two swept spheres intersect.
  15. >
  16. >Two spheres intersect if the sum of their radii is greater than or equal to the
  17. >distance between their centers.
  18.  
  19. Perhaps what the original poster means by a swept sphere is the set
  20. of points obtained by sweeping a sphere along a line segment, which
  21. produces a cylinder with spherical endcaps.
  22.