Students Supervised
Total number: 57
Ph.D. Theses:

Perouz Taslakian,
Geometric
and Computational Aspects of Musical Rhythm, thesis in progress.

Greg Aloupis,
Reconfiguration
of Polygonal Structures, March 2005.

Michael Soss,
Geometric
and Computational Aspects of Molecular Reconfiguration, September,
2001.

Francisco Gomez,
Computing
Nice Projections of Objects in Space, July 1996.

Prosenjit Bose,
Geometric
and Computational Aspects of Manufacturing Processes, 1994.

Binhai Zhu,
Computational
Geometry in 2.5 Dimensions, 1994.

JeanMarc Robert, Linear Approximation and Line Transversals, June
1991, (cosupervised jointly with Prof. David Avis).

Michael E. Houle,
Weak
Separation of Sets, July, 1989.

Thomas C. Shermer,
Visibility
Properties of Polygons, June 1989 (cosupervised jointly with Prof.
David Avis).

David Rappaport,
The
Complexity of Computing Simple Circuits in the Plane, February 1987,
(cosupervised jointly with Prof. David Avis).

Hossam
A. ElGindy, Hierarchical Decomposition of Polygons With Applications,
May 1985, (cosupervised jointly with Prof. David Avis).

JorgRudiger Sack, Rectilinear
Computational Geometry, June, 1984.

Binay K. Bhattacharya,
Applications
of Computational Geometry to Pattern Recognition Problems, 1981.

Selim Akl,
The Travelling
Salesman Problem, 1978, (Cosupervised jointly with Prof. Monroe Newborn).

Leslie H. Oliver,
Automatic
Image Processing and Pattern Recognition for Biomedical Research, September,
1978.

Rajan
Shinghal, Using Contextual Information to Improve Performance of
Character Recognition Machines, March, 1977.
Masters Theses:

Hani Ezzadeen, Extraction and Segmentation of MRI Brain Images,
May 2006 (cosupervised with Dr. L. Soualmi).

Justin Colannino, Measures of String Similarity with Applications,
June
2005.

Greg Aloupis,
On
Computing Geometric Estimators of Location, April 2001.

Hormoz Pirzadeh,The Rotating
Calipers as a Tool in Computational Geometry, May 1999.

Michael Soss,
On the
Size of the Sphere of Influence Graph, July 1998.

Ioannis Rekleitis,
Visual
Motion Estimation Based on Visual Blurr Interpretation, September,
1995 (cosupervised).

Elsa OmanaPulido, Some Aperture Angle Optimization Problems, 1994.

David Eu, Approximating Polygonal Curves in Two and Three Dimensions,
October 1992.

Eric Guevremont, On Envelopes of Arrangements of Lines, August 1992.

Patrice Belleville,
Computing
TwoCovers of Simple Polygons, July, 1991.

Naji Mouawad, Minimal Obscuring Sets, November, 1990.

Marek Teichman,
Wedge
Placement Optimization Problems, June 1989.

David Samuel, Computing the External Geodesic Diameter of a Simple Polygon,
September, 1988.

Minou Mansouri, On the Reachability of a Ladder in Two Convex Polygons,
August 1986.

Teren Gum, Visibility Between Two Edges of a Simple Polygon, Summer
1985.

Michael McKenna, Finding the Minimum Vertex Distance Between Two Disjoint
Convex Polygons in Linear Time, 1983.

Diana C. Bouchard, Combined Topdown and Bottomup Algorithms for Using
Context in Text Recognition, Spring 1979.

Rhonda ToppstonAmsel,
Unsupervised
Learning Algorithms Applied to Data Analysis, August, 1977.

Robert L. Cahn, Feature Extraction and Evaluation for Cervical Cell
Recognition, August, 1977.

Laurence C.F. Pang, A Method for Measuring the Curvature of a Boundary
on a 2dimensional Quantized Grid, November, 1975.

Shirley S. Chung, Using Contextual Information From the English Language
to Improve the Performance of Character Recognition Machines, March,
1975.

Patricia F. Sharpe, Statistical Classification Techniques Applied to
Disease Diagnosis, January, 1974.
Masters Projects:

Imad Khoury, Computational Geometric Analysis of Gene Sequences,
2006.

Alain Turki, Quadrangulations, 1995.

Claudia Pateras, TextLine Orientation Estimation in Document Analysis,
1994.

Mary M. McQueen, The Ultimate Convex Hull Algorithm in Practice,
1984.

Shigeo Inoue, An Implementation of Decomposing Simple Rectilinear Polygons
into Convex Quadrilaterals (JorgR. Sack's Algorithm), March 1983.

Jaber Kadhim Farhan, Implementation of a Convex Hull Algorithm for Points
in Three Dimensions, March 30, 1982.

Jim A. McAlear, Computing the Maximum Distance Between Two Finite Planar
Sets, 1981.

Ronald Greti, An O(n) Approximate Convex Hull Algorithm, June 1978.

Lesley P. Chang, A NonParametric Feature Selection Method based on
GraphTheoretical Clustering Techniques, December 1976.

Lesley P. Chang, Application of Sequential Classification Methods using
Decision Trees to a Problem in Medical Diagnosis, December 1976.
Post Doctoral Students:

Dr. Stefan Langerman, 20012003

Dr. Patrick Morin,
200102

Dr. Sylvain Lazard,
199798.

Dr. Suneeta Ramaswami,
199497.

Dr. Hazel Everett, 199092.
Undergraduate Research
Projects:

Jakob Teitelbaum, RHYTHMOS: An Interactive Software System for Exploring
and Understanding Musical Rhythm, April 2006.

Jakob Teitelbaum, RHYTHMOS Junior, April 2006.

Michael Hawker, RHYTHMOS Junior, April 2006.

Benjamin Marlin, Constructing Convex 3Polytopes from Two Trinagulations
of a Polygon, April 2002.