| |
|
|
| |
| | 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. |
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 79
reviews
|
|
|
 |
|
|
|
|
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...
|
Jan 1 2021 |
|
|
|
|
|
|
 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...
|
Feb 25 2020 |
|
|
|
|
|
|
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...
|
Aug 8 2016 |
|
|
|
|
|
|
Origami5: Fifth International Meeting of Origami Science, Mathematics, and Education
Wang-Iverson P., Lang R., Yim M., A. K. Peters, Ltd., Natick, MA, 2011. 660 pp. Type: Book (978-1-568817-14-9)
As is evident from its title, this is the fifth in a series of proceedings from an unusual conference involving an unusual confluence of fields, whose practitioners--artists, educators, scientists, and mathematicians—...
|
Aug 13 2012 |
|
|
|
|
|
|
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...
|
Feb 23 2012 |
|
|
|
|
|
|
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....
|
Feb 14 2012 |
|
|
|
|
|
|
Hausdorff distance under translation for points and balls
Agarwal P., Har-Peled S., Sharir M., Wang Y. ACM Transactions on Algorithms 6(4): 1-26, 2010. Type: Article
In the protein docking problem, pairs of molecules modeled as unions of balls are shape-matched by finding close but noncolliding positionings of the molecules. This provides one motivation for this work, which develops algorithms for ...
|
Nov 18 2010 |
|
|
|
|
|
|
Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
Barak B., Kindler G., Shaltiel R., Sudakov B., Wigderson A. Journal of the ACM 57(4): 1-52, 2010. Type: Article
A 2-source randomness extractor is a function that accepts two weakly random bit strings and outputs a better random string--better in the sense that it is uniformly distributed. The extractor samples the input bits intelligen...
|
Aug 11 2010 |
|
|
|
|
|
|
Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
Miller E., Pak I. Discrete & Computational Geometry 39(1): 339-388, 2008. Type: Article
This is a long, complex, and incredibly rich paper. It contains, in some sense, one main result: the source unfolding that unfolds the surface of a convex polyhedron P to a planar, nonoverlapping polygon
|
Apr 8 2010 |
|
|
|
|
|
|
Localized spanner construction for ad hoc networks with variable transmission range
Peleg D., Roditty L. ADHOC-NOW 2008 (Proceedings of the 7th International Conference on Ad-hoc, Mobile, and Wireless Networks, Sophia-Antipolis, France, Sep 10-12, 2008) 135-147, 2008. Type: Proceedings
A spanner of a geometric graph G is a spanning subgraph S, such that the length of the shortest path between any two vertices in G is well approximated by the distance provided b...
|
Mar 11 2010 |
|
|
|
|
|
| |
|
|
| |
|
|
