Published May 27, 2012
| Version v1
Journal article
Open
Near-pole polar diagram of objects and duality
Authors/Creators
- 1. Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic
- 2. Department of Computer Science, Mathematical Science Faculty, Alzahra University
Description
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.
Notes
Computational Geometry, Computer Science, Visibility, Voronoi Diagram, Computational Complexity, Algorithm, Facility Location, Symbolic layout, visibility, dynamic programming, VLSI design, 𝐾-Center Problem; Farthest Point Voronoi Diagram; Center Hull, Hybrid Optimization Algorithm, Support Vector Machine, Whale Optimization Algorithm, Dragonfly Algorithm, Feature Selection, Art Gallery, k-modem, Illumination, Guarding, Competitive Facility Location, Voronoi Game, Game Theory