Feodor F. Dragan 1990 Ph.D. in Theoretical Computer Science Institute of Mathematics of the Byelorussian Academy of Science, Minsk. Moldova State University (1988 – 1996) University of Duisburg (1994 – 1995) University of Rostock (1996 – 1999) UCLA (1999 – 2000) ???. Research interests.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Simple rectilinear polygon, vertices, edges
Rectilinear path in P
Length of the path
- metric d(x,y) in P
number of users located at a point
is a median point if
Theoretical results used
(P,d) is a median space
Any convex compact subset of a median space is gated
Med(P) is convex and forms a simple rectilinear polygon inside of P
etc. etc. etc.
A link central point and the link diameter of a simple rectilinear polygonChepoi & Dragan,Comput. Sci. J. of Moldova, `93; Russian J. of Oper. Res., `94
is a central point if
is the minimum eccentricity of a point in P.
is the maximum eccentricity of a point in P.
Theoretical results used (c.)
The center C(P) is not necessarily connected but forms an orthogonal convex set.
The Helly property for intervals, etc., etc., etc.
eccentricity of a cut
or find instaircase,
or repeat all for