Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region

1984 ◽  
pp. 209-217
Author(s):  
O. Sýkora ◽  
I. Vrto
Keyword(s):  
Convex Region

Distribution of distance within a convex region. I. x≤d

1976 ◽  
Vol 16 (4) ◽  
pp. 546-551
Author(s):  
E. Gečiauskas
Keyword(s):  
Convex Region ◽  
Region I

An irreducible non-convex region

1953 ◽  
Vol 49 (2) ◽  
pp. 194-200 ◽  
Author(s):  
Kathleen Ollerenshaw ◽  
L. J. Mordell
Keyword(s):  
Convex Region ◽  
Image Position

Some years ago I showed ((4), § 6, pp. 88–91) that the star domain K defined by the inequalitieshas the minimum determinant Δ(K) = 2 and has an infinity of singular critical lattices. In this note I show that there is a unique irreducible star domain . That ís to say, there is just one star domain H contained in but different from K for which Δ(H) = Δ(K) = 2, and such that Δ(H′) < 2 for every star domain H′ contained in but different from H.

Quasi fircke polygons and the Nielsen convex region

1980 ◽  
Vol 172 (3) ◽  
pp. 239-244
Author(s):  
Norman Purzitsky
Keyword(s):  
Convex Region

Efficient algorithm for placing a given number of base stations to cover a convex region

2006 ◽  
Vol 66 (11) ◽  
pp. 1353-1358 ◽  
Author(s):  
Gautam K. Das ◽  
Sandip Das ◽  
Subhas C. Nandy ◽  
Bhabani P. Sinha
Keyword(s):  
Efficient Algorithm ◽  
Base Stations ◽  
Convex Region
Sign in / Sign up

Export Citation Format

Share Document