| Many computational methods highly depend on the grid information of domain. In this talk, we propose a simple and easy grid scheme to generate an unstructured grid for any geometric domain in two dimensional domain. The main idea comes from the traditional Delaunay methods. With a minor modification, we can generate a grid with almost linear compuational complexity. In this talk, I shall also discuss the object-oriented approach to implement the grid generation so that the grid information can be easily accessedby different computational methods. |