 |
|
|
|
|
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) (secondreview), 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.
|
|
|
Reviews by Joseph J. O’Rourke |
|
| |
|
|
|
Computing the geometric intersection number of curves
Despré V., Lazarus F. Journal of the ACM 66(6): 1-49, 2019. Type: Article
More than a century ago, Poincaré asked for a procedure to determine if a closed curve γ on a compact surface S could be contracted to a point, and suggested a computationally expensive method. Dehn...
|
|
|
|
|
|
 Discrete geodesic nets for modeling developable surfaces
Rabinovich M., Hoffmann T., Sorkine-Hornung O. ACM Transactions on Graphics (TOG) 37(2): 1-17, 2018. Type: Article
Developable surfaces are those that can be flattened to the plane isometrically, that is, without stretching or tearing. They play an important role in manufacturing and architecture, for example, curved glass can be constructed by rol...
|
|
|
|
|
|
Origami 6
Miura K., Kawaskai T., Tachi T., Uehara R., Lang R., Wang-Iverson P., American Mathematical Society, Providence, RI, 2016. 736 pp. Type: Book (978-1-470418-74-8)
Cutting and flattening a cardboard box (say, for recycling) results in a planar polygon. It is quite a surprise to learn that some box unfoldings can be refolded to a different box. For example, a 1 x 1 x 5 box can be unfolded and refo...
|
|
|
|
|
|
Circular arc structures
Bo P., Pottmann H., Kilian M., Wang W., Wallner J. ACM Transactions on Graphics (TOG) 30(4): 1-12, 2011. Type: Article
A circular arc structure (CAS) is a mesh of a surface with edges realized by circular arcs, such that all edges incident to a vertex are tangent to a common plane, and form a repeatable pattern of angles about interior vertices so that...
|
|
|
|
|
|
Model synthesis: a general procedural modeling algorithm
Merrell P., Manocha D. IEEE Transactions on Visualization and Computer Graphics 17(6): 715-728, 2011. Type: Article
Creating animations or game environments requires the construction of meticulously detailed 3D geometric models, an often tedious and expensive process. The aim of the work described in this paper is to partially automate this process....
|
|
|
|
|
| |
more...
|
|
|
|
