Near-quadratic bounds for the L1 Voronoi diagram of moving points

Author:

Chew L.Paul

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference9 articles.

1. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences;Agarwal;J. Combin. Theory Ser. A,1989

2. Voronoi diagrams—a survey of a fundamental geometric data structure;Aurenhammer;ACM Comput. Surveys,1991

3. Voronoi diagrams based on convex distance functions;Chew,1985

4. Placing the largest similar copy of a convex polygon among polygonal obstacles;Chew,1989

5. A convex polygon among polygonal obstacles: placement and high-clearance motion;Chew;Computational Geometry: Theory and Applications,1993

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

1. Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions;Discrete & Computational Geometry;2015-09-08

2. On Kinetic Delaunay Triangulations;Journal of the ACM;2015-06-30

3. On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions;2013 IEEE 54th Annual Symposium on Foundations of Computer Science;2013-10

4. On Topological Changes in the Delaunay Triangulation of Moving Points;Discrete & Computational Geometry;2013-06

5. A simple and efficient kinetic spanner;Computational Geometry;2010-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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