COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN…计算平面几何图的最大值.pdfVIP

  • 8
  • 0
  • 约8.9万字
  • 约 22页
  • 2018-03-02 发布于四川
  • 举报

COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN…计算平面几何图的最大值.pdf

COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN…计算平面几何图的最大值.pdf

Journal of Computational Geometry jocg.org COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN SUBQUADRATIC TIME ∗ Christian Wulff-Nilsen † Abstract. Let G be a plane graph where each edge is a line segment. We consider the problem of computing the maximum detour of G, defined as the maximum over all pairs of distinct points p and q of G of the ratio between the distance between p and q in G and the 2 Euclidean di

文档评论(0)

1亿VIP精品文档

相关文档