| Student Project |
Sources of Reference |
| Allen: Simulating flocking behaviour in
nature.
|
- C. Reynolds, "Flocks, herds and schools: A distributed behavioral
model", Computer Graphics, 21(4), July 1987, pp. 25-34. (ACM
SIGGRAPH '87 Conference Proceedings)
- Boids page
maintained by Craig Reynolds.
|
| Atkins: Fundamental algorithms for robot
path planning.
|
- T. Lozano-Perez and M. Wesley, "An Algorithm for Planning
Collision-Free Paths Among Polyhedral Obstacles", Communications of the
ACM, 22(10), October 1979, pp.560--570.
- S. Ghosh and D. Mount, "An output-sensitive algorithm for
computing visibility graphs", SIAM J. Computing, 20(5), 1991,
pp. 888-910.
|
| Babineau: A web-based database
application for the registrar's office.
|
|
| Connors: Floodlight illumination of
polygonal regions.
|
- B. Speckmann and C. Tóth, "Allocating vertex
π-guards in simple polygons via pseudo-triangulations",
Discrete and Computational Geometry, 33(2), 2005, pp. 345-364.
- V. Estivill-Castro, J. O'Rourke, J. Urrutia, and D. Xu,
"Illumination of polygons with vertex lights", Information
Processing Letters, 56, 1995, pp. 9-13.
|
| Gwalthney: Collision detection among
moving convex objects.
|
- H. Edelsbrunner, "Computing the extreme distances between two
convex polygons", Journal of Algorithms, 6, 1985, pp. 213-224.
- E. Gilbert, D. Johnson, and S. Keerthi, "A fast procedure for
computing the distance between complex objects in three-dimensional
space", IEEE Journal of Robotics and Automation, 4(2), 1988,
pp. 193-203.
|
| Kalaria: Applications of generalized
Voronoi diagrams in two dimensions.
|
- D.T.Lee, "On k-nearest neighbor Voronoi diagrams in the
plane", IEEE Transactions on Computers, C-31(6), 1982,
pp. 478-487.
- C. Ó'Dúnlaing and C.K.Yap, "A retraction method
for the planning motion of disc" , J. Algorithms, 6, 1985,
pp.104-111.
- A. Aggarwal, H. Imai, N. Katoh, and S. Suri, "Finding k
points with minimum diameter and related problems", Journal of
Algorithms, 12, 1991, pp. 38-56.
- F. Aurenhammer, "Voronoi diagrams: A survey of a fundamental
geometric data structure", ACM Computing Surveys, 23(3), 1991,
pp. 345-405.
|
| Spiegel: Guard placement for wireless
localization.
|
- D. Eppstein, M. Goodrich, and N. Sitchinava, "Guard placement
for efficient point-in-polygon proofs", in Proc. 23rd Annual ACM
Symp. on Computational Geometry (SoCG), 2007, pp. 27-36.
- T. Christ, M. Hoffmann, Y. Okamoto, and T. Uno. "Improved
bounds for wireless localization", in Proc. 11th Scand. Workshop
Algorithm Theory (SWAT), LNCS 5124 (Springer-Verlag), 2008, pp. 77-89.
|