ABSTRACT
The convex hull and Delaunay triangulation [1-5] are among the essential concepts in computational geometry and also in various scientific fields. The concepts certainly have an important relationship in which they are closely related to each other. This chapter will explain these essential concepts and discuss some algorithms to solve the problems of convex hull and Delaunay triangulation.
