 | Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro - 1991 - 518 Seiten
...VoronoT diagram of a convex polygon. Discr. and Comp. Geom., 4:591-604, 1989. [2] J. Boissonnat, 0. Devillers, R. Schott. M. Teillaud, and M. Yvinec....sampling to on-line algorithms in computational geometry. Discr. and Comp. Geom. To be published. Full paper available as Technical Report INRIA 1285. Abstract... | |
 | Alain Finkel, Matthias Jantzen - 1992 - 644 Seiten
.../, = O(r) for fixed d. For such point sets, a random deletion requires O(logn) expected time. [BDS+] JD Boissonnat, O. Devillers, R. Schott, M. Teillaud,...on-line algorithms in computational geometry. Discrete and Computational Geometry. To be published. Available as Technical Report INRIA 1285. Abstract published... | |
 | Burkhard Monien - 1992 - 406 Seiten
...and obstacle-avoiding shortest paths. Zeitschrift fur Operations Research, 32:145-164, 1988. [BDS+90] JD Boissonnat, O. Devillers, R. Schott, M. Teillaud,...random sampling to on-line algorithms in computational geoiiietrv. Technical Report 1285, INRIA Sophia-Antipolis, 1990. [BDT90] JD Boissonnat, O. Devillers,... | |
 | Dingzhu Du, Frank Hwang - 1992 - 414 Seiten
...end Ann. Symp. Comp. Geom. 260-268, 1989. 6. J.-D. Boissonnat, 0. Devillers, R. Schott, M. Teillaud, M. Yvinec, Applications of random sampling to online algorithms in computational geometry, research report 1285, INRIA-Sophia Antipolis, 1990. 7. A. Bowyer, Computing Dirichlet tessellations,... | |
 | Kam W. Ng - 1993 - 566 Seiten
...where ct(n) is the extremely slow growing functional inverse of the Ackermann function. References 1. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud,...in computational geometry. Discrete Comput. Geom., 8:51-71, 1992. 2. JD Boissonnat and K. Dobrindt. Randomized construction of the upper envelope of triangles... | |
 | Jan van Leeuwen - 1994 - 536 Seiten
...diagrams: a survey of a fundamental geometric data structure. ACM Comput. Surv., 23:345-405, 1991. [BDS+90] JD Boissonnat, O. Devillers, R. Schott, M. Teillaud,...sampling to on-line algorithms in computational geometry. Technical report, INRIA, 1990. [BDS+92] J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and... | |
 | 1994 - 756 Seiten
...solve the line segment intersection problem in time 0(m + nlogn). References [BDS+92] JD Boissonnat, 0. Devillers, R. Schott, M. Teillaud, and M. Yvinec....on-line algorithms in computational geometry. Discrete and Computational Geometry, 8:51-71, 1992. [CE92] B. Chazelle and H. Edelsbrunner. An optimal algorithm... | |
 | Horst Reichel - 1995 - 454 Seiten
...Diagrams — A Survey of a Fundamental Geometric Data Structure. ACM Computer Surveys 23(3), 1991. [3] JD Boissonnat, O. Devillers, R. Schott, M. Teillaud,...on-line algorithms in computational geometry. Discrete & Comput. Geom. 8, pp. 51-71, 1992. [4] KL Clarkson and PW Shor: Applications of Random Sampling in... | |
 | Tetsuo Asano - 1996 - 470 Seiten
...Annual ACM Symposium on Theory of Computing, 1994, pages 105—114. 2. J.-D. Boissonnat, 0. Devilers, R. Schott, M. Teillaud, and M. Yvinec. Applications...on-line algorithms in computational geometry. Discrete and Computational Geometry 8 (1992), 51—71. 3. K. L. Clarkson. New applications of random sampling... | |
 | Jean-Daniel Boissonnat, Mariette Yvinec - 1998 - 548 Seiten
...Computing the union of 3-colored triangles. Internal. J. Comp. Geom. AppL, 1(2):187-196, 1991. [28] J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud,...on-line algorithms in computational geometry. Discrete Comp. Geom., 8:51-71, 1992. [29] J.-D. Boissonnat, O. Devillers, and M. Teillaud. A semidynamic construction... | |
| |
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. 
