By Topic

On Properties of Forbidden Zones of Polygons and Polytopes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Berkowitz, R. ; Dept. of Math. Rutgers, State Univ. of New Jersey, New Brunswick, NJ, USA ; Kalantari, B. ; Menendez, D. ; Kalantari, I.

Given a region R in a Euclidean space and a distinguished point p ∈ R, the forbidden zone, F(R, p), is the union of all open balls with center in R, having p as a common boundary point. For a polytope, the forbidden zone is the union of open balls centered at its vertices. The notion of forbidden zone was defined in [1] and shown to be instrumental in the characterization of mollified zone diagrams, a relaxation of zone diagrams, introduced by Asano, et al. [2], itself a variation of Voronoi diagrams. In this article we focus on properties of F(P, p) where P is a convex polygon. We derive formulas for the area and circumference of F(P, p) when p is fixed, and for minimum areas and circumferences when p is allowed to range in P. Moreover, we give formulas for the area and circumference of a flower-shaped region corresponding to intersecting circles in F(P, p), and for optimal values as p ranges in P. We also extend our formulas for p ∈ P. We then develop a formula for the area of the intersection of circles having a common boundary point. The optimization problems associate interesting centers to a polygon, even to a triangle, different from their classical versions. Aside from geometric interest, applications could exist. Finally, we extend some of the above results and optimizations to arbitrary polytopes and bounded convex sets.

Published in:

Voronoi Diagrams in Science and Engineering (ISVD), 2012 Ninth International Symposium on

Date of Conference:

27-29 June 2012