Highest order Voronoi diagram optimization

Computational geometry is concerned with the design and analysis of algorithms for geometrical problems. In addition, other more practically oriented, areas of computer science-such as computer graphics, computer-aided design, robotics, pattern recognition, and operation research-give rise to problems that inherently are geometrical. A method that is commonly used is Voronoi diagram. Voronoi diagram is a diagram that divides plane based on nearest neighbour approach. This method does not require checking objects one by one. In Voronoi diagram there is a new variation named Highest Order Voronoi Diagram. Highest order voronoi diagram can be used directly to identify the region for various type of spatial queries and can be used for all order Voronoi Diagram. From work related there is a method named FLIP. Deficiency from work related is data structure for construction are too high which makes construction of Highest Order Voronoi Diagram is heavy. Therefore, in this paper will present Left with Least-Angle Movement (LAM) method for construction Highest Order Voronoi Diagram that change data structure to scale up data that can be processed.