← Back to VOLUME 2, ISSUE 12, DECEMBER 2013
This work is licensed under a Creative Commons Attribution 4.0 International License.
Fortune's Method An Efficient Method For Voronoi Diagram Construction
MS.PUNAM MARBATE, MS.REETU GUPTA Department of Computer Science & Engineering, Rajiv Gandhi College of Engineering & Research, Nagpur, India Department of Computer Science & Engineering, Priyadarshani Indira Gandhi College of Engineering, Nagpur, India
Downloads: Download PDF
π 41 viewsπ₯ 1 download
Abstract: This Paper briefly describes the Fortune's method i.e. Fortune's sweepline algorithm for constructing voronoi diagram. There are a variety of algorithms available to construct Voronoi diagrams. One popular method is the incremental algorithm that adds a new site to an already existing diagram. In 1985, Steve Fortune developed a plane- sweep algorithm which is more efficient in time than any incremental algorithm. There are many approaches to constructing Voronoi diagrams. Some methods are more efficient in terms of time than others.
Here, we have tried to explore the aspects regarding fortune's method.
Keywords: Voronoi Diagram, Dirichlet Tesselation, Delaunay Triangulation
Here, we have tried to explore the aspects regarding fortune's method.
Keywords: Voronoi Diagram, Dirichlet Tesselation, Delaunay Triangulation
How to Cite:
[1] MS.PUNAM MARBATE, MS.REETU GUPTA Department of Computer Science & Engineering, Rajiv Gandhi College of Engineering & Research, Nagpur, India Department of Computer Science & Engineering, Priyadarshani Indira Gandhi College of Engineering, Nagpur, India, βFortune's Method An Efficient Method For Voronoi Diagram Construction,β International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)
This work is licensed under a Creative Commons Attribution 4.0 International License.