Showing results 1 to 9 of 9
Computing and verifying depth orders Berg, Mark de; Overmars, Mark; Cheong, Otfried, 8th Annual ACM Symposium on Computational Geometry (SoCG) 1992, pp.138 - 145, 1992-06-10 |
Computing the Maximum Overlap of Two Convex Polygons Under Translations Berg, Mark de; Devillers, Olivier; Kreveld, Marc van; Cheong, Otfried; Teillaud, Monique, 7th Ann. International Symp. on Algorithms and Computation, pp.126 - 135, 1996-12-16 |
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams Agarwal, Pankaj; Berg, Mark de; Matousek, Jiri; Cheong, Otfried, 10th Annual ACM Symposium on Computational Geometry (SoCG) 1994, pp.67 - 75, 1994-06-06 |
On Lazy Randomized Incremental Construction Berg, Mark de; Dobrindt, Katrin; Cheong, Otfried, 25th Annual ACM Symposium on Theory of Computing (STOC 1993), pp.105 - 114, 1993-05-16 |
Piecewise Linear Paths Among Convex Obstacles Berg, Mark de; Matousek, Jiri; Cheong, Otfried, 25th Annual ACM Symposium on Theory of Computing (STOC 1993), pp.505 - 514, 1993-05-16 |
Reaching a Goal with Directional Uncertainty Berg, Mark de; Guibas, Leonidas; Halperin, Dan; Overmars, Mark; Cheong, Otfried; Sharir, Micha; Teillaud, Monique, 4th International Symposium on Algorithms and Computation, pp.1 - 10, 1993-12-15 |
Separating an Object from its Cast Ahn, Hee-Kap; Berg, Mark de; Bose, Prosenjit; Cheng, Siu-Wing; Halperin, Dan; Matousek, Jiri; Cheong, Otfried, 13th Annu. ACM Symposium on Computational Geometry (SoCG 1997), pp.221 - 230, 1997-06-04 |
Shortcuts for the Circle Cheong, Otfried; Bae, Sang Won; Berg, Mark de; Gudmundsson, Joachim; Levcopoulos, Christos, The 28th International Symposium on Algorithms and Computation, ISAAC Committee, 2017-12-11 |
Spanning Trees Crossing Few Barriers Asano, Tetsuo; Berg, Mark de; Cheong, Otfried; Guibas, Leo J.; Snoeyink, Jack; Tamaki, Hisao, 15th Annual ACM Symposium on Computational Geometry (SoCG) 1999, pp.41 - 48, 1999-06-13 |
Discover