Search
Results 11-20 of 21 (Search time: 0.004 seconds).
| NO | Title, Author(s) (Publication Title, Volume Issue, Page, Issue Date) |
|---|---|
| A Simple On-Line Randomized Incremental Algorithm for Computing Higher-Order Voronoi Diagrams Franz Aurenhammer; Cheong, Otfried, INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.2, no.4, pp.363 - 381, 1992-07 | |
| BOUNDS ON THE SIZE OF MERGING NETWORKS AIGNER, M; Cheong, Otfried, DISCRETE APPLIED MATHEMATICS, v.61, no.3, pp.187 - 194, 1995-08 | |
| PIECEWISE-LINEAR PATHS AMONG CONVEX OBSTACLES DEBERG, M; MATOUSEK, J; Cheong, Otfried, DISCRETE COMPUTATIONAL GEOMETRY, v.14, no.1, pp.9 - 29, 1995-07 | |
| 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 | |
| Computing many faces in arrangements of lines and segments Agarwal, PK; Matousek, J; Cheong, Otfried, SIAM JOURNAL ON COMPUTING, v.27, no.2, pp.491 - 505, 1998-04 | |
| Separating and shattering long line segments Efrat, A; Cheong, Otfried, INFORMATION PROCESSING LETTERS, v.64, no.6, pp.309 - 314, 1997-12 | |
| Range searching in low-density environments Cheong, Otfried; Vleugels, J, INFORMATION PROCESSING LETTERS, v.60, no.3, pp.121 - 127, 1996-11 | |
| A deterministic algorithm for the three-dimensional diameter problem Matousek, J; Cheong, Otfried, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.6, no.4, pp.253 - 262, 1996-07 | |
| 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 | |
| Approximation of convex figures by pairs of rectangles Cheong, Otfried; Fuchs, U; Rote, G; Welzl, E, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.10, no.2, pp.77 - 87, 1998-05 |
Discover