http:^^www.cs.dartmouth.edu^~scot^
来自「This data set contains WWW-pages collect」· EDU^~SCOT^ 代码 · 共 51 行
EDU^~SCOT^
51 行
Date: Tue, 14 Jan 1997 23:06:36 GMTServer: NCSA/1.4.2Content-type: text/htmlLast-modified: Mon, 17 Jun 1996 20:48:17 GMTContent-length: 1606<HTML><HEAD><TITLE>Robert L. (Scot) Drysdale, III</TITLE></HEAD><BODY> <H1>Robert L. (Scot) Drysdale, III, Professor </H1> <!WA0><IMG SRC="http://www.cs.dartmouth.edu/faculty/pix/Drysdale.gif"> <H2> Ph.D. <!WA1><A HREF="http://www-cs.stanford.edu/"> Stanford University </A>, 1979. </H2> <B>Research Interests: </B> <BR> Professor Drysdale's research area is algorithms, primarily computational geometry. Much of his work has dealt with computing a structure called the Voronoi diagram and its geometric dual the Delaunay Triangulation. In particular, he has invented algorithms for computing the Voronoi Diagram of line segments, for Voronoi diagrams when distances are measured by Convex Distance Functions, and for Voronoi diagrams which simulate crystal growth. He has found ways to use the Delaunay triangulation to find fixed-radius near neighbors, to find the k nearest neighbors of each point in a set, and to enumerate pairs of points in increasing order of interpoint distance. Professor Drysdale has also done work on computing greedy triangulations and has been working with a Mechanical Engineer in the area of Numerical Control (NC) machining. <P> <B>(603) 646-2101 </B> <BR> <ADDRESS>scot@cs.dartmouth.edu</ADDRESS> <H4> <!WA2><IMG SRC="http://www.cs.dartmouth.edu/images/yellowball.gif" ALT="*"> <!WA3><A HREf="http://www.cs.dartmouth.edu/reports/authors/Drysdale,Robert.L..Scot.html"> Technical Reports</A><BR> </H4> <P><!WA4><IMG SRC="http://www.cs.dartmouth.edu/images/roundgrey.gif" ALT=" "><P><H4><!WA5><IMG align="middle" SRC="http://www.cs.dartmouth.edu/images/Dtree.gif"> <!WA6><A HREF="http://www.cs.dartmouth.edu/~scot//">Back to Dartmouth CS Home Page</A></H4></BODY></HTML>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?