About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 29. Chapters: Bernard Chazelle, Boris Aronov, Chandrajit Bajaj, Daniel Spielman, David Avis, David Eppstein, David G. Kirkpatrick, David Mount, David P. Dobkin, Der-Tsai Lee, Diane Souvaine, Dinesh Manocha, Emo Welzl, Erik Demaine, Frances Yao, Franco P. Preparata, Godfried Toussaint, Gyorgy Elekes, Herbert Edelsbrunner, Ileana Streinu, Ivan Rival, Jacob E. Goodman, Janos Pach, Jan van Leeuwen, Ji i Matou ek (mathematician), John Canny, John Reif, Jonathan Shewchuk, Jon Bentley, Jorg-Rudiger Sack, Joseph O'Rourke (professor), Joseph S. B. Mitchell, Kenneth L. Clarkson, Klara Kedem, Kurt Mehlhorn, Leonidas J. Guibas, Lydia Kavraki, Maria Klawe, Mark Overmars, Martin Demaine, Matthew T. Dickerson, Michael Ian Shamos, Michael T. Goodrich, Micha Sharir, Mihai P tra cu, Mikhail Atallah, Ming C. Lin, Nathan Netanyahu, Nimrod Megiddo, Pankaj K. Agarwal, Pierre Rosenstiehl, Piotr Indyk, Raimund Seidel, Roberto Tamassia, Robert Connelly, Shang-Hua Teng, Subhash Suri, Sue Whitesides, Timothy M. Chan. Excerpt: Janos Pach (born May 3, 1954) is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry. Pach was born and grew up in Hungary. He comes from a distinguished academic family: his father, Zsigmond Pal Pach was a well known historian, and his uncle Pal Turan was one of the best known Hungarian mathematicians. Pach received his Candidate degree from the Hungarian Academy of Sciences, in 1983, where his advisor was Miklos Simonovits. He is a Distinguished Professor of Mathematics at CUNY, a Research Professor at the Courant Institute of Mathematics at NYU, a Research Fellow of the Alfred Renyi Institute of Mathematics in the Hungarian Academy of Sciences, and Professor of Mathematics at the Ecole Polytechnique Federale de Lausanne. He was the program chair for the International Symposium on Graph Drawing in 2004, and (with Herbert Edelsbrunner and Gunter Ziegler) is co-editor-in-chief of the journal Discrete and Computational Geometry. Pach has authored several books and over 200 research papers. He was one of the most frequent collaborators of Paul Erd s, authoring over 20 papers with him and thus has an Erd s number of one. Pach's research is focused in the areas of discrete geometry and geometric graph theory. Some of Pach's most-cited research work concerns the combinatorial complexity of families of curves in the plane and their applications to motion planning problems, the maximum number of k-sets and halving lines that a planar point set may have, crossing numbers of graphs, and embedding of planar graphs onto fixed sets of points. Pach received the Grunwald Medal of the Janos Bolyai Mathematical Society (1982), the Ford Award from the Mathematical Association of America (1990), and the Alfred Renyi Prize from the Hungarian Academy of Sciences (1992). In 2011 he was listed as a fellow of the Association for Computing Machinery for his research in computational geometry.
