I work with
Robert Scot Drysdale,
Cliff Stein, and
Neal Young
in the broad field of Computer Algorithms. More specifically,
my current research is in Approximation Algorithms and Computational
Geometry.
If you are not familiar with the field of Computer Algorithms, the please read a brief overview
I have provided on this topic:
Currently I am investigating the Rectilinear Minimum Bends Path problem
in higher dimensions. This problem asks, what the path through
a set of obstacles between two points which will minimize the number
of bends along that path.
Previous results have discovered an O(n log n) algorithm for this
problem in two dimensions and an O(n^2 log n + n^2I) for this
problem in three dimensions.
My current work involves looking at a possible
O(Dn^2 log n) algorithm for this problem in any dimension.
Please read my research abstract for more information.
Publications relevant to my research
Optimal Covering Tours with Turn Costs. Symposium on Discrete Algorithms, 2001;
Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sandor P. Fekete, Joseph S. B. Mitchell, and Saurabh Sethia.
3D Rectilinear Motion Planning with Minimum Bend Paths. International Conference on Intelligent Robots and Systems, 2001;
Robert Fitch, Zach Butler, Daniela Rus.
Rectilinear Paths among Rectilinear Obstacles. International Symposium on Algorithms and Computation, 1996;
D.T. Lee, C.D. Yang, C.K. Wong.
Polynomial-time Approximation Schemes for Euclidean TSP and other Geometric
Problems (1996); Sanjeev
Arora;
To appear in the Journal of the ACM; [Postscript]