Abstract

AbstractThe order-k Voronoi diagrams are difficult to construct because of their complicated structures. In traditional algorithm, production process was extremely complex. While discrete algorithm is only concerned with positions of generators, so it is effective for constructing Voronoi diagrams with complicated shapes of Voronoi polygons. It can be applied to order-k Voronoi diagram with any generators, and can get over most shortcomings of traditional algorithm. So it is more useful and effective. Model is constructed with discrete algorithm. And the application example shows that the algorithm is both simple and useful, and it is of high potential value in practice.KeywordsVoronoi diagramdiscreteorder-k

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.