|Dates:||Wednesday, September 26|
|Topic:||Range Searching in Computational Geometry|
Range Searching, P. Agarwal.
CRC Handbook of Computational Geometry (E. Goodmand and J.
O'Rourke, eds.). PDF file for this paper.
Geometric Range Searching and its Relatives, P. Agarwal and J. Erickson, Advances in Discrete and Comput. Geom. (B. Chazelle, E. Goodman, and R. Pollack eds.), American Mathematical Society, Providence, 1998. PDF file for this paper.
|Speakers:||First guest lecture by Prof. Pankaj Agarwal from Duke University|
|Dates:||Wednesday, October 3|
|Topic:||Shape Smoothing Agorithms|
Curve and Surface Smoothing Without Shrinkage,
G. Taubin. International Conference on Computer Vision (ICCV '95),
A Signal-Processing Approach to Fair Surface Design, G. Taubin. SIGGRAPH '95 Conference Proceedings, Annual Conference Series, pages 351-358. ACM SIGGRAPH, Addison Wesley, Aug. 1995. PDF file for this paper.
|Dates:||Wednesdays, October 10 and 17|
|Topic:||Penetration Depth Computation and Collision Response|
|Papers:|| Computing the Intersection-Depth
of Polyhedra, D. Dobkin, J. Hershberger, D. Kirkpatrick and
S. Suri. Algorithmica, volume 9 (6), 518-533, 1993. PDF file for this
Enhancing GJK: Computing Minimum and Penetration Distances Between Convex Polyhedra, S. Cameron. Int. Conf. Robotics & Automation (ICRA '97), April 1997. PDF file for this paper.
Penetration Depth of Two Convex Polytopes in 3D, P. Agarwal, L. Guibas, S. Har-Peled, A. Rabinovitch, and M. Sharir. Nordic J. Computing, 7 (2000), 227-240. PDF file for this paper.
Proximity Queries and Penetration Depth Computation on 3D Game Objects, G. van den Bergen. Game Developers Conference, 2001. PDF file for this paper.
Penetration Depth Estimation for Elastic Bodies Using Deformed Distance Fields, S. Fisher and M. Lin. IROS 2001. PDF file for this paper.
V. Milenkovic and H. Schmidl.
Stephen Lindholm, Charity Lu, Man Cho Anthony So, Ming Tam, Feng Xie
|Date:||Wednesday, October 24|
Algorithmic Techniques for Geometric Optimization,
P. Agarwal and M. Sharir. Computer Science Today: Recent Trends
and Developments, Lecture Notes in Computer Science, vol. 1000
(J. van Leeuwen, ed.), Springer-Verlag, Berlin, 1995. PDF file for this paper.
Efficient Algorithms for Geometric Optimization,
P. Agarwal and M. Sharir. ACM Computing Surveys, 30 (1998),
412-458. PDF file for this paper.
Randomized Algorithms for Geometric Optimization Problems, P. Agarwal and S. Sen. Handbook of Randomization (P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, eds.), Kluwer Academic Publishers, to appear. PDF file for this paper.
|Speakers:||Second guest lecture by Prof. Pankaj Agarwal from Duke University|
|Date:||Wednesdays, October 31 and November 7|
|Topic:||Shape Indexing Algorithms|
|Papers:||Locally Adaptive Dimensionality
Reduction for Indexing Large Time
Series Databases, E. Keogh, K. Chakrabarti, S. Mehrotra,
M. Pazzani. SIGMOD, 2001. PDF file for this
Matching Shapes, S. Belongie, J. Malik, J. Puzicha. ICCV, 2001. PDF file for this paper.
Recognition of Shapes by Editing Shock Graphs, T. Sebastian, P. Klein, and B. Kimia. ICCV, 2001, 755-762. PDF file for this paper.
Matching 3D Models with Shape Distributions, R. Osada, T. Funkhouser, B. Chazelle andD. Dobkin. Manuscript, 2001. PDF file for this paper.
Topology Matching for Fully Automatic Similarity
Estimation of 3D
Shapes, M. Hilaga, Y. Shinagawa, T. Kohmura, and T. L.
SIGGRAPH 2001, Computer Graphics Proceedings, Annual
|Speakers:||Arnaud Dartois, Olaf Hall-Holt, Niloy Mitra, Jaewon Shin|
|Date:||Wednesday, November 14|
|Topic:||Morse Complexes for Piecewise-Linear 2-Manifold Simplification|
Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds, H. Edelsbrunner, J. Harer, and A. Zomorodian. 17th Annu. ACM Sympos. Comput. Geom., 2001. PDF file for this paper.
|Date:||Wednesday, November 21|
Automatic Indentification and Representation of Protein Binding Sites for Molecular Docking, J. Ruppert, W. Welch, and A. Jain. Protein Science 6 (1997), 524--533. PDF file for this paper.
Modelling protein docking using shape complementarity,
|Speakers:||Itay Lotan, Daniel Russel|
|Date:||Wednesdays, November 28, December 5 and 12|
|Topic:||Straightening Polygonal Linkages|
Movement Problems for 2-Dimensional Linkages, J. E. Hopcroft and D. A. Joseph, and S. H. Whitesides. SIAM J. Comput.,13 (1984), 610-629. Available in hardcopy only.
Straightening Polygonal Arcs and Convexifying
Polygonal Cycles, R. Connelly, E. D. Demaine, and G. Rote.
41st Annual Symposium on Foundations of Computer Science (FOCS),
Redondo Beach, California, 12-14 November 2000, pp. 432-442. PDF file for this paper.
A Combinatorial Approach to Planar Non-Colliding Robot Arm Motion Planning, I. Streinu. 41st Annual Symposium on Foundations of Computer Science (FOCS), Redondo Beach, California, 12-14 November 2000, pp. 443-453. PDF file for this paper.
Expansive Motions and the Polytope of Pointed Pseudo-Triangulations, G. Rote, F. Santos and I. Streinu. Manuscript, 2001. PDF file for this paper.
|Speakers:||Jie Gao, Rachel Kolodny, An Nguyen, An Zhu|
Last update: Wednesday, October 6, 2001