- Michael Ian Shamos
Michael Ian Shamos (born April 21, 1947, and often referred to as Mike Shamos) is an American mathematician, attorney, book author, journal editor, consultant and company director. He is (with Franco P. Preparata) the author of Computational Geometry (Springer-Verlag, 1985), which was for many years the standard textbook in computational geometry, and is known for the Shamos–Hoey sweep line algorithm for line segment intersection detection and for the rotating calipers technique for finding the width and diameter of a geometric figure. His publications also include works on electronic voting, the game of billiards, and intellectual property law in the digital age.
He was a fellow of Sigma Xi (1974–83), had an IBM Fellowship at Yale University (1974–75), was SIAM National Lecturer (1977–78), distinguished lecturer in computer science at the University of Rochester (1978), visited McGill University (1979), and belonged to the Duquesne University Law Review (1980–81). He won the first annual Black & White Scotch Achiever’s Award in 1991 for contributions to bagpipe musicography, and the Industry Service Award of the Billiard and Bowling Institute of America, 1996, for contributions to billiard history. Since 2001 he is a Billiard Worldcup Association official referee.
He has been editor in chief of the Journal of Privacy Technology (2003–2006), a member of the editorial boards of Electronic Commerce Research Journal and the Pittsburgh Journal of Technology, Law and Policy, and a contributing editor of Billiards Digest magazine.
Shamos is the author of The New Illustrated Encyclopedia of Billiards (Lyons, 1999) among other related works, and is the curator of the Billiards Museum and Archive.
Michael Shamos is the Director of the MS in IT eBusiness Technology program at Carnegie Mellon University.
Wikimedia Foundation. 2010.
Look at other dictionaries:
Cue sports — Billiards redirects here. For other uses, see Billiard (disambiguation). Cue sports Engraving from Charles Cotton s 1674 book, The Compleat Gamester Highest governing body World Confederation of Billiard Sports First played 15th … Wikipedia
Irving Crane — (November 13, 1913 ndash; November 17, 2001),The New York Times Company (2001). Obituaries section: [http://www.nytimes.com/2001/11/25/obituaries/25CRAN.html? Irving Crane, a World Champion Who Brought Decorum to Billiards, Dies at 88] by Douglas … Wikipedia
List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… … Wikipedia
QuickHull — ist ein Algorithmus zur Berechnung der Konvexen Hülle einer beliebigen Punktemenge im zwei und dreidimensionalen Raum. Die Konvexe Hülle einer Menge von Punkten wird beschrieben durch einen geschlossenen Polygonzug welcher die Verbindung aller… … Deutsch Wikipedia
Computational geometry — is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to… … Wikipedia
Geometría computacional — Cilindro renderizado mediante un programa de ordenador. La geometría computacional es una rama de las ciencias de la computación dedicada al estudio de algoritmos que pueden ser expresados en términos de la geometría. Algunos de los problemas… … Wikipedia Español
Isothetic polygon — An isothetic polygon is a polygon whose alternate sides belong to two parametric families of straight lines which are pencils of lines with centers at two points (possibly in the infinity). The most well known example of isothetic polygons are… … Wikipedia
Rectilinear polygon — Some examples of rectilinear polygons A rectilinear polygon is a polygon all of whose edges meet at right angles. Thus the interior angle at each vertex is either 90° or 270°. Rectilinear polygons are a special case of isothetic polygons. In many … Wikipedia
Facility location — Facility location, also known as location analysis, is a branch of operations research and computational geometry concerning itself with mathematical modeling and solution of problems concerning optimal placement of facilities in order to… … Wikipedia
Proximity problems — is a class of problems in computational geometry which involve estimation of distances between geometric objects. A subset of these problems stated in terms of points only are sometimes referred to as closest point problems, although the term… … Wikipedia