Algorithms for Geometric Problems of Practical Interest

计算几何作为一个领域处理几何问题的算法方面。然而，大多数现有的研究都局限于涉及二维直线的问题。该项目的目标是为曲面和三维物体开发改进的计算方法，然后为一系列优化问题开发有效的算法，包括曲面和三维物体的内外逼近，三维网格生成，以及VLSI设计的直线和固定方向的预制划分。

Computational geometry as a field deals with the algorithmic aspects of geometric problems. Most of the existing research has been restricted, however, to problems involving straight lines in two dimensions. The goal of this project is to develop improved computational methods for both curved objects and three-dimensional objects and then to develop efficient algorithms for a collection of optimization problems, including inner and outer approximation of curved and three-dimensional objects, three-dimensional mesh generation, and pre-fabrication partitioning of both rectilinear and fixed-orientation of VLSI designs.