NEAR POLE POLAR DIAGRAM OF POINTS AND ITS DUALITY WITH APPLICATIONS

In this paper we propose a new approach to plane partitioning with similar features to those of Polar
Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in
regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the
Contracted dual of it, present an optimal algorithms to draw them and discuss the applications and optimality
of the algorithms.