Showing results 1 to 7 of 7
Computing the maximum overlap of two convex polygons under translations de Berg, M; Cheong, Otfried; Devillers, O; van Kreveld, M; Teillaud, M, THEORY OF COMPUTING SYSTEMS, v.31, no.5, pp.613 - 628, 1998 |
Constructing levels in arrangements and higher order Voronoi diagrams Agarwal, PK; de Berg, M; Matousek, J; Cheong, Otfried, SIAM JOURNAL ON COMPUTING, v.27, no.3, pp.654 - 667, 1998-06 |
Optimal spanners for axis-aligned rectangles Asano, T; de Berg, M; Cheong, Otfried; Everett, H; Haverkort, H; Katoh, N; Wolff, A, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.30, no.1, pp.59 - 77, 2005-01 |
Separating an object from its cast Ahn, HK; de Berg, M; Bose, P; Cheong, Otfried; Halperin, D; Matousek, J; Schwarzkopf, O, COMPUTER-AIDED DESIGN, v.34, no.8, pp.547 - 559, 2002-07 |
Spanning trees crossing few barriers Asano, T; de Berg, M; Cheong, Otfried; Guibas, LJ; Snoeyink, J; Tamaki, H, DISCRETE COMPUTATIONAL GEOMETRY, v.30, no.4, pp.591 - 606, 2003-12 |
Sparse geometric graphs with small dilation Aronov, B; de Berg, M; Cheong, Otfried; Gudmundsson, J; Haverkort, H; Vigneron, A, ALGORITHMS AND COMPUTATION BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3827, pp.50 - 59, 2005 |
(Undefined) |
Discover