Berg, M.T. de, Cheong, O., Kreveld, M.J. van & Overmars, M.H. (2008). Computational Geometry -- Algorithms and Aplications (3rd). Berlin: Springer-Verlag.
|
Bose, J., Cabello, S., Cheong, O., Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2006). Area-preserving approximations of polygonal paths. J. of Discrete Algorithms, 4, 554-566.
|
Ahn, H.K., Berg, M.T. de, Cheong, O., Haverkort, H.J., Stappen, A.F. van der & Toma, L. (2006). River networks and watershed maps of triangulated terrains revisited. In I. Emiris, I. Emiris, M. Karevalas, M. Karevalas, L. Palios & L. Palios (Eds.), Abstracts of the 22nd European Workshop on Computational Geometry (EWCG'06) (pp. 173-176).
|
Bose, P., Cabello Justo, S., Cheong, O., Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2004). Area-Preserving Approximations of Polygonal Paths. UU-CS 2004-043. Utrecht: Utrecht University: Information and Computing Sciences.
|
Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M. & Oostrum, R.W. van (2004). Competitive Facility Location: the Voronoi Game. Theoretical Computer Science, 310, 357-372.
|
Cheng, S.-W., Cheong, O., Everett, H. & Oostrum, R.W. van (2004). Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. Discrete and Computational Geometry, 32, 401-415.
|
Asano, T., Berg, M.T. de, Cheong, O., Everett, H., Haverkort, H.J., Katoh, M. & Wolff, A. (2004). Optimal Spanners for Axis-Aligned Rectangles. UU-CS 2004-008. Utrecht: Utrecht University: Information and Computing Sciences.
|
Cheong, O., Shin, C.S. & Vigneron, A. (2002). Computing farthest neighbors on a convex polytope. UU-CS 2002-013. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Cheng, S.W., Cheong, O., Everett, H. & Oostrum, R.W. van (2002). Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. UU-CS 2002-016. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Bose, P., Cheong, O. & Morin, P.J. (2002). On Simplifying Dot Maps. UU-CS 2002-038. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Asano, T., Berg, M.T. de, Cheong, O., Guibas, L.J., Snoeyink, J. & Tamaki, H. (2002). Spanning trees crossing few barriers. UU-CS 2002-012. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Cheong, O., Har-Peled, S., Linial, N. & Matousek, J. (2002). The One-Round Voronoi Game. UU-CS 2002-034. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Cheong, O., Har-Peled, S. & Linial, N. (2002). The One-Round Voronoi Game. In Proceedings of the 18th Annual Symposium on Computational Geometry (pp. 97-101). ACM Press.
|
Na, H.S., Lee, C.N. & Cheong, O. (2002). Voronoi Diagrams on the Sphere. Computational Geometry: Theory and Applications, 23, 183-194.
|
Ahn, H.K., Cheong, O. & Shin, C.S. (2001). Building bridges between convex regions. UU-CS 2001-46. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Oostrum, R.W. van, Cheong, O. & Ahn, H.K. (2001). Casting a polyhedron with directional uncertainty. UU-CS 2001-48. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Ahn, H.K., Cheng, S.W., Cheong, O., Golin, M. & Oostrum, R.W. van (2001). Competitive Facility Location along a Highway. In J. Wang (Ed.), Computing and combinatorics: 7th annual international conference. Berlin, Germany: Springer-Verlag.
|
Ahn, H.K., Cheng, S.W., Cheong, O., Golin, M. & Oostrum, R.W. van (2001). Competitive facility location along a highway. UU-CS 2001-45. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Cheong, O., Shin, C.S. & Vigneron, A. (2001). Computing Farthest Neighbors on a Convex Polytope. In J. Wang (Ed.), Computing and combinatorics: 7th annual international conference. Berlin, Germany: Springer-Verlag.
|
Cheong, O. & Oostrum, R.W. van (2001). Reaching a Polygon with Directional Uncertainty. International journal of computational geometry & applications, 11.
|
Na, H.S., Lee, C.L. & Cheong, O. (2001). Voronoi diagrams on the sphere. UU-CS 2001-47. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Asano, T., Cheong, O., Berg, M.T. de, Guibas, L.J., Snoeyink, J. & Tamaki, H. (1999). Spanning trees crossing few barriers. In Proceedings 15st Annual ACM Symposium on the Theory of Computing (pp. 41-48). New York: ACM Press.
|
Berg, M.T. de, Cheong, O., Devillers, O., Kreveld, M.J. van & Teillaud, M. (1998). Computing the maximum overlap of two convex polygons under translations. Theory of computing systems, 31, 613-628.
|
Cheong, O. & Oostrum, R.W. van (1998). Reaching a polygon with directional uncertainty. UU-CS 1998-11. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Ahn, H.K., Berg, M.T. de & Cheong, O. (1998). Separating an object from its cast. UU-CS 1998-16. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de & Cheong, O. (1997). Computing a single cell in the overlay of two simple polygons. UU-CS 1997-15. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Kreveld, M.J. van & Cheong, O. (1996). Computing the Maximum Overlap of Two Convex Polygons Under Translations. UU-CS 1996-33. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H., Rao, A.S., Cheong, O. & Wentink, C.J. (1996). Immobilizing polygons against a wall. UU-CS 1996-11. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Cheong, O. & Vleugels, J.M. (1996). Range searching in low-density environments. UU-CS 1996-26. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Agarwal, P.K. & Cheong, O. (1995). Constructing levels in arrangements and higher order Voronoi diagrams. UU-CS 1995-06. Utrecht: Utrecht University.
|
Agarwal, P.K. & Cheong, O. (1994). Computing many faces in arrangements of lines and segments. UU-CS 1994-39. Utrecht.
|
Berg, M.T. de & Cheong, O. (1994). On lazy randomized incremental construction. UU-CS 1994-12. Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Cheong, O. (1994). Reaching a goal with directional uncertainty. UU-CS 1994-09. Utrecht.
|
Agarwal, P.K. & Cheong, O. (1994). The overlay of lower envelopes and its applications. UU-CS 1994-40. Utrecht.
|
Berg, M.T. de & Cheong, O. (1993). Piecewise linear paths among convex obstacles. RUU-CS 93-20. Utrecht.
|
Cheong, O. (1992). A deterministic algorithm for the three-dimensional diameter problem. RUU-CS 92-45. Utrecht.
|
Berg, M.T. de & Cheong, O. (1992). Cuttings and Applications. RUU-CS 92-26. Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Cheong, O. (1991). Computing and verifying depth orders. RUU-CS 91-41. Utrecht.
|
webmaster@cs.uu.nl,
Wed, 23 May 2012 22:16:37 +0200
←
Departement Informatica, Universiteit Utrecht