| |
|
|
| |
| | After graduating from St. Joseph's University (physics and mathematics), O'Rourke studied computer science at the University of Pennsylvania, from which he received a PhD in 1980. He then joined the faculty of Johns Hopkins University as an assistant professor. O'Rourke was promoted to associate professor in 1985, and then left in 1988 to found and chair the computer science department of Smith College, as the Olin Professor of Computer Science. O'Rourke has received several grants and awards, including a Presidential Young Investigator Award in 1984, a Guggenheim Fellowship in 1987, and the NSF Director's Award for Distinguished Teaching Scholars in 2001. His research is in the field of computational geometry, where he has published a
monograph (Oxford, 1987), a
textbook (Cambridge, 1994; 2/e 1998), coedited the 1,500-page
Handbook of Discrete and Computational Geometry (CRC Press, 1997; 2/e 2004), coauthored another monograph,
Geometric Folding Algorithms: Polyhedra, Origami, Polyhedra (Cambridge, 2007) (second
review), and is currently writing two new books. More than thirty of his 140 papers published in journals and conference proceedings are co-authored with undergraduates. |
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 69
reviews
|
|
|
 |
|
|
|
|
Randomized self-assembly for approximate shapes
Kao M., Schweller R. Automata, languages and programming, Part I (Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Part I, Reykjavik, Iceland, Jul 7-11, 2008) 370-384, 2008. Type: Proceedings
Most theoretical investigations of self-assembly are based on Winfree’s tile assembly model, in which unit squares with specific glues on each side bind in a mixture to spontaneously form a desired shape. Ultimately, that shape may be a...
|
Aug 18 2009 |
|
|
|
|
|
|
 Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues
Demaine E., Demaine M., Fekete S., Ishaque M., Rafalin E., Schweller R., Souvaine D. Natural Computing: an international journal 7(3): 347-370, 2008. Type: Article
The leading model for exploring the complexity of self-assembly is Winfree’s tile assembly model, whose units are Wang tiles--squares with specific glues on each side, where glues of the same type bind to one another. A mix of tiles...
|
Aug 14 2009 |
|
|
|
|
|
|
Three-dimensional construction with mobile robots and modular blocks
Werfel J., Nagpal R. International Journal of Robotics Research 27(3-4): 463-479, 2008. Type: Article
In a sense, this paper shows how to build a three-dimensional (3D) object from smart blocks, using dumb robots....
|
Aug 13 2009 |
|
|
|
|
|
|
Visibility algorithms in the plane
Ghosh S., Cambridge University Press, New York, NY, 2007. 332 pp. Type: Book
This excellent, focused monograph summarizes a remarkable quarter-century of progress in research on two-dimensional (2D) visibility algorithms. The book captures every major trend in visibility research in comprehensive, sometimes excruciating,...
|
Jan 20 2009 |
|
|
|
|
|
|
Freeform surfaces from single curved panels
Pottmann H., Schiftner A., Bo P., Schmiedhofer H., Wang W., Baldassini N., Wallner J. ACM Transactions on Graphics 27(3): 1-10, 2008. Type: Article
Freeform surfaces are increasingly used in spectacular steel and glass architectural designs. Constructing such a surface from flat pieces renders it polyhedral, diminishing the aesthetics of curved surfaces. Constructing it from doubly curved...
|
Jan 16 2009 |
|
|
|
|
|
|
Algorithms in algebraic geometry (IMA Volumes in Mathematics and its Applications)
Dickenstein A., Schreyer F., Sommese A., Springer, 2007.Type: Book
This thin but dense volume emerged from a 2006 workshop of the same title, a workshop that drew 110 participants. The reader who has never heard of fewnomials, cohomology rings, the Zariski topology, or a Schubert variety will have difficulty...
|
Jul 30 2008 |
|
|
|
|
|
|
Random bichromatic matchings
Bhatnagar N., Randall D., Vazirani V., Vigoda E. Algorithmica 50(4): 418-445, 2008. Type: Article
The thermodynamic properties of a film of diatomic molecules accumulated through adsorption on a surface can be studied through a lattice of dimers. Abstractly, this is a grid graph of horizontal and vertical edges, usually on a torus....
|
Jun 11 2008 |
|
|
|
|
|
|
A note on optimal floodlight illumination of stages
Dietel J., Hecker H., Spillner A. Information Processing Letters 105(4): 121-123, 2008. Type: Article
Although the original version of the stage illumination problem is now known to be nondeterministic polynomial time (NP) hard, one variant can be solved in polynomial time (in fact, in O(n log...
|
Feb 22 2008 |
|
|
|
|
|
|
Flying over a polyhedral terrain
Zarrabi-Zadeh H. Information Processing Letters 105(3): 103-107, 2008. Type: Article
The problem of computing the shortest path between two points, under a variety of metrics, has been studied extensively due to both its geometric naturalness and its extensive applications. It is largely solved in two dimensions and is long known ...
|
Jan 29 2008 |
|
|
|
|
|
|
Curve and surface reconstruction: algorithms with mathematical analysis (Cambridge Monographs on Applied and Computational Mathematics)
Dey T., Cambridge University Press, New York, NY, 2006. 228 pp. Type: Book
This is a worthy successor to Edelsbrunner’s 2001 book [1], published in the same “Cambridge Monographs” series, tracking that book in digestible length, mathematical rigor, clarity, and focus on Voronoi diagrams and Delaunay...
|
Sep 14 2007 |
|
|
|
|
|
| |
|
|
| |
|
|
