Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
429583 | Journal of Computational Science | 2012 | 5 Pages |
Abstract
The polar diagram of a set of points in a plane and its extracted dual EDPD were recently introduced for static and dynamic cases. In this paper, the near-pole polar diagram NPPD for a set of points is presented. This new diagram can be considered as a generalization of the polar diagram and has applications in several communication systems and robotics problems. After reviewing the NPPD of points, we solve the problem for a set of line segments and simple polygons in optimal time Θ(n log n), where n is the number of line segments or polygon vertices. We introduce duality for the NPPD of points and identify some applications.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bahram Sadeghi Bigham, Marzieh Eskandari, Maryam Tahmasbi,