Kinetic and dynamic data structures for convex hulls and upper envelopes-Reference-Cited by-同舟云学术

Kinetic and dynamic data structures for convex hulls and upper envelopes

Published:2007-02 Issue:2 Volume:36 Page:144-158
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Alexandron Giora,Kaplan Haim,Sharir Micha

Publisher

Elsevier BV

Subject

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

Reference24 articles.

1. Lower bounds for kinetic planar subdivisions;Agarwal;Discrete Comput. Geom.,2000

2. P.K. Agarwal, M. de Berg, J. Gao, L.J. Guibas, S. Har-Peled, Staying in the middle: Exact and approximate medians in R1 and R2 for moving points, Manuscript, 2003

3. P.K. Agarwal, J. Erickson, L. Guibas, Kinetic binary space partitions for intersecting segments and disjoint triangles, in: Proc. 9th Annual ACM–SIAM Sympos. Discrete Algorithms, 1998, pp. 107–116

4. Proc. European Sympos. Algorithms;Agarwal,2002

5. Maintaining the extent of a moving point set;Agarwal;Discrete Comput. Geom.,2001

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

1. Agglomerative Clustering of Growing Squares;Algorithmica;2021-11-20

2. Agglomerative Clustering of Growing Squares;LATIN 2018: Theoretical Informatics;2018

3. A simple, faster method for kinetic proximity problems;Computational Geometry;2015-05

4. Kinetic Euclidean minimum spanning tree in the plane;Journal of Discrete Algorithms;2012-10

5. Kinetic Pie Delaunay Graph and Its Applications;Algorithm Theory – SWAT 2012;2012