跳到主要导航 跳到搜索 跳到主要内容

Hitting a set of line segments with one or two discrete centers

  • Xiaozhou He
  • , Zhihui Liu
  • , Bing Su
  • , Yinfeng Xu
  • , Feifeng Zheng
  • , Binhai Zhu
  • Sichuan University
  • Shandong Technology and Business University
  • Xi'an Technological University
  • Donghua University
  • Montana State University

科研成果: 会议稿件 › 论文 › 同行评审

1 引用 (Scopus)

摘要

Given the scheduling model of bike-sharing, we consider the problem of hitting a set of n axis-parallel line segments in R2 by a square (and two squares) whose center(s) must lie on some line segment(s) such that the (maximum) edge length of the square(s) is minimized. Under a different model, we also consider the cases when one needs to compute one (and two) centers on some edge(s) of a tree of size m, where n labeled segments must be hit, and the objective is to minimize the maximum path length from the labeled segments to the nearer center(s). We give three linear-time algorithms and an O(n2 log n) algorithm for the four problems in consideration.

源语言英语
页85-90
页数6
出版状态已出版 - 2018
活动30th Canadian Conference on Computational Geometry, CCCG 2018 - Winnipeg, 加拿大
期限: 8 8月 2018 → 10 8月 2018

会议

会议30th Canadian Conference on Computational Geometry, CCCG 2018
国家/地区加拿大
市Winnipeg
时期8/08/18 → 10/08/18

学术指纹

探究 'Hitting a set of line segments with one or two discrete centers' 的科研主题。它们共同构成独一无二的学术指纹。

引用此