Cover of: Computing the geodesic center of a simple polygon | Richard Pollack Read Online
Share

Computing the geodesic center of a simple polygon by Richard Pollack

  • 170 Want to read
  • ·
  • 71 Currently reading

Published by Courant Institute of Mathematical Sciences, New York University in New York .
Written in English


Book details:

Edition Notes

Statementby R. Pollack, M. Sharir.
SeriesRobotics report -- 74
ContributionsSharir, M.
The Physical Object
Pagination14 p.
Number of Pages14
ID Numbers
Open LibraryOL17979057M

Download Computing the geodesic center of a simple polygon

PDF EPUB FB2 MOBI RTF

  The geodesic center of a simple polygon is a point inside the polygon which minimizes the maximum internal distance to any point in the polygon. We present an algorithm which calculates the geodesic center of a simple polygon with n vertices in time O (n log n).Cited by: In this paper, we show that the L 1 geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric properties of the L 1 geodesic balls, that is, the metric balls with respect to the L 1 geodesic : BaeSang Won, KormanMatias, OkamotoYoshio, WangHaitao. The geodesic center of a simple polygon is a point inside the polygon which minimizes the maximum internal distance to any point in the polygon. We present an algorithm which calculates the geodesic center of a simple polygon with n vertices in time O(n log n).   Given a simple polygon P and a set Q of points contained in P, we consider the geodesic k-center problem in which we seek to find k points, called centers, in P to minimize the maximum geodesic distance of any point of Q to its closest by: 1.

If you have a disability and are having trouble accessing information on this website or need materials in an alternate format, contact [email protected] for [email protected] for Cited by: 1. Computing the Geodesic Center of a Simple Polygon Moreover, assume that a, b, c are arranged so that as x varies along g(b', c') from b' to c', the vector u(a', x) (weakly) turns clockwise (as in Fig. 2).Cited by: The geodesic center of a simple polygon is either the center of its geodesic diameter or a vertex of the geodesic farthest-point Voronoi diagram. Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time Sang Won Baey Matias Kormanz;x Yoshio Okamoto{Haitao Wangk 24th September, Abstract In this paper, we show that the L 1 geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric properties of the LCited by: 6.

The diameter of a set S of points is the maximal distance between a pair of points in S. The center of S is the set of points that minimize the distance to their furthest neighbours. The problem of finding the diameter and center of a simple polygon. computing the Euclidean geodesic center of a simple polygon with an O(n4 logn)-time algorithm, and later Pollack, Sharir, and Rote [10] improved it to O(nlogn) time. Since then, it has been a longstanding open prob-lem whether the geodesic center can be computed in linear time, as . The geodesic center of a simple polygon is a point inside the polygon which minimizes the maximum internal distance to any point in the polygon. @MISC{Schuierer94computingthe, author = {S. Schuierer}, title = {Computing the Geodesic L_1-Diameter and Center of a Simple Rectilinear Polygon}, year = {}} Share. OpenURL. Abstract. The diameter of a set S of points is the maximal distance between a pair of points in S. The center of S is the set of points that minimize the distance to.