Author:
de Berg M.,Dobrindt K.,Schwarzkopf O.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference21 articles.
1. B. Aronov and M. Sharir. Triangles in space or building (and analyzing) castles in the air.Combinatorica, 10(2):137–173, 1990.
2. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry.Discrete Comput. Geom., 8:51–71, 1992.
3. J. D. Boissonnat and K. Dobrindt. Randomized construction of the upper envelope of triangles inR 3.Proc. 4th Canad. Conf. on Computational Geometry, pp. 311–315, 1992.
4. J.-D. Boissonnat and M. Teillaud. On the randomized construction of the Delaunay tree.Theoret. Comput. Sci., 112:339–354, 1993.
5. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir and J. Snoeyink. Computing a face in an arrangement of line segments.Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pp. 441–448, 1991.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions;Lecture Notes in Computer Science;2024
2. Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions;SIAM Journal on Computing;2022-05-26
3. Optimal Algorithms for Geometric Centers and Depth;SIAM Journal on Computing;2022-05-19
4. Minimum Cell Connection in Line Segment Arrangements;International Journal of Computational Geometry & Applications;2017-09
5. Tessellation;Wiley Interdisciplinary Reviews: Computational Statistics;2014-03-25