Representing a Functional Curve by Curves with Fewer Peaks-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Representing a Functional Curve by Curves with Fewer Peaks

Published:2011-03-25 Issue:2 Volume:46 Page:334-360
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Chen Danny Z.,Wang Chao,Wang Haitao

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-011-9338-8.pdf

Reference32 articles.

1. Bansal, N., Coppersmith, D., Schieber, B.: Minimizing setup and beam-on times in radiation therapy. In: Proc. of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 27–38 (2006)

2. Barequet, G., Chen, D.Z., Daescu, O., Goodrich, M., Snoeyink, J.: Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica 33(2), 150–167 (2002)

3. Chan, S., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimum error. Int. J. Comput. Geom. Appl. 6, 59–77 (1996)

4. Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6, 485–524 (1991)

5. Chen, D.Z., Daescu, O.: Space-efficient algorithms for approximating polygonal curves in two dimensional space. Int. J. Comput. Geom. Appl. 13(2), 95–111 (2003)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Algorithms for Obnoxious Facility Location on a Line Segment or Circle;2023 IEEE 12th International Conference on Cloud Networking (CloudNet);2023-11-01

2. Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane;Computer Networks;2023-06

3. Poster: Quadratic-Time Algorithms for Optimal Min-Max Barrier Coverage with Mobile Sensors on the Plane;2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS);2021-07

4. Minimizing maximum movement of sensors for line barrier coverage in the plane;Computer Networks;2019-11

5. Fluctuated Fitting Under the $$\ell _1$$ -metric;Frontiers in Algorithmics;2017

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3