Author:
Boissonnat Jean-Daniel,Devillers Olivier,Schott René,Teillaud Monique,Yvinec Mariette
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference15 articles.
1. D. Avis, H. ElGindy, and R. Seidel, Simple on-line algorithms for convex polygons,Computational Geometry (G. T. Toussaint, ed.), North-Holland, Amsterdam, 1985, pp. 23–42.
2. J.-D. Boissonnat, O. Devillers, and M. Teillaud, A semi-dynamic construction of higher-order Voronoi diagrams and its randomized analysis,Algorithmica (to appear). Full paper available as Technical Report INRIA 1207. Abstract published inSecond Canadian Conference on Computational Geometry, Ottawa 1990.
3. J.-D. Boissonnat and M. Teillaud, A hierarchical representation of objects: the Delaunay tree,Second ACM Symposium on Computational Geometry, Yorktown Heights, June 1986.
4. J.-D. Boissonnat and M. Teillaud, On the randomized construction of the Delaunay tree,Theoretical Computer Science (to appear). Full paper available as Technical Report INRIA 1140.
5. B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane,IEEE Symposium on Foundations of Computer Science, 1988, pp. 590–600.
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Randomized Incremental Convex Hull is Highly Parallel;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
2. Offset polygon and annulus placement problems;Computational Geometry;2014-04
3. Dynamic well-spaced point sets;Computational Geometry;2013-08
4. Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings;SIAM Journal on Computing;2010-01
5. Dynamic well-spaced point sets;Proceedings of the 2010 annual symposium on Computational geometry - SoCG '10;2010