
Cabello, S., Berg, M. van den, Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2009). Maximizing the Area of Overlap of two Unions of Disks under Rigid Motion. International Journal of Computational Geometry and Applications, 533-556. Silveira, R.I. & Oostrum, R.W. van (2007). Flooding countries and destroying dams. (UU-CS 2007-032). onbekend: UU WINFI Informatica en Informatiekunde. Moet, E.J., Kreveld, M.J. van & Oostrum, R.W. van (2007). Region intervisibility in terrains. In Vol. 17. International Journal of Computational Geometry and Applications (pp. 331-347). Benkert, M., Gudmundsson, J. G., Knauer, C., Moet, E.J., Oostrum, R.W. van & Wolff, A. (2006). A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. In D.Z. Chen & D.T. Lee (Eds.), Computing and Combinatorics, 12th Annual International Conference, COCOON 2006 Vol. 4112. Lecture Notes in Computer Science (pp. 166-175). Taipei, Taiwan. Moet, E.J., Kreveld, M.J. van & Oostrum, R.W. van (2005). Region Intervisibility in Terrains. (UU-CS 2005-028). onbekend: UU WINFI Informatica en Informatiekunde. 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. Kreveld, M.J. van, Oostrum, R.W. van, Bajaj, C., Pascucci, V. & Schikore, D. (2004). Contour Trees and Small Seed Sets for Isosurface Generation. In Sanjay Rana (Ed.), Topological Data Structures for Surfaces (pp. 71-85). Wiley. Chwa, K.-Y., Jo, B.-C., Knauer, C., Moet, E.J., Oostrum, R.W. van & Shin, C.-S. (2004). Guarding Art Galleries by Guarding Witnesses. In R. Fleischer & G. Trippen (Eds.), Algorithms and Computation, Proc. 15th International Symposium (ISAAC 2004) (pp. 352-363). Springer-Verlag. Chwa, K.-Y., Jo, B.-C., Knauer, C., Moet, E.J., Oostrum, R.W. van & Shin, C.-S. (2004). Guarding Art Galleries by Guarding Witnesses. In A. Márquez (Ed.), Abstracts of the 20th European Workshop on Computational Geometry (pp. 167-170). Universidad de Sevilla. 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. Berg, M.T. de, Cabello Justo, S., Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2004). Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. In A. Márquez (Ed.), Abstracts of the 20th European Workshop on Computational Geometry (pp. 73-76). Universidad de Sevilla. Berg, M.T. de, Cabello Justo, S., Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2004). Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. In T. Hagerup & J. Katajainen (Eds.), Algorithm Theory, Proc. 9th Scandinavian Workshop (SWAT 2004) (pp. 138-149). Springer-Verlag. Oostrum, R.W. van & Veltkamp, R.C. (2004). Parametric Search Made Practical. Computational Geometry: Theory and Applications, 28, 75-88. Aronov, B., Kreveld, M.J. van, Oostrum, R.W. van & Varadarajan, K. (2003). Facility location on terrains. Discrete and Computational Geometry, 30, 357-372. Chwa, K.Y., Jo, B.Ch., Knauer, C., Moet, E.J., Oostrum, R.W. van & Shin, C.S. (2003). Guarding Art Galleries by Guarding Witnesses. (UU-CS 2003-044). Utrecht: Utrecht University: Information and Computing Sciences. Berg, M.T. de, Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2003). The Area of Overlap of two Unions of Convex Objects under Translations. (UU-CS 2003-025). Utrecht: Utrecht University, Institute of Information and Computing S. Veltkamp, R.C., Typke, R., Giannopoulos, P., Wiering, F. & Oostrum, R.W. van (2003). Using Transportation Distances for Measuring Melodic Similarity. Utrecht: Utrecht University, Institute of Information and Computing S. Typke, R., Giannopoulos, P., Veltkamp, R.C., Wiering, F. & Oostrum, R.W. van (2003). Using transportation distances for measuring melodic similarity. In Holger H. Hoos & David Bainbridge (Eds.), Proceedings of the Fourth International Conference on Music Information Retrieval (ISMIR) 2003 (pp. 107-114). Baltimore: Johns Hopkins University. 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. Oostrum, R.W. van & Veltkamp, R.C. (2002). Parametric Search Made Practical. In Proceedings of the Eight Annual Conference of the Advanced School for Computing and imaging (ASCI 2002) (pp. 135-142). Delft, the Netherlands: Advanced School for Computing and Imaging. Oostrum, R.W. van & Veltkamp, R.C. (2002). Parametric Search Made Practical. In Proceedings of the Eighteenth Annual Symposium on Computational Geometry (SoCG'02) (pp. 1-9). New York, USA: ACM Press. Oostrum, R.W. van & Veltkamp, R.C. (2002). Parametric Search Made Practical. (UU-CS 2002-050). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences. Oostrum, R.W. van & Veltkamp, R.C. (2002, June 4). Parametric Search using CGAL. Barcelona, Spain, CGAL User Workshop, Universitat Politecnica de Catalunya. 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. Aronov, B., Kreveld, M.J. van, Oostrum, R.W. van & Varadarajan, K. (2001). Facility location on terrains. (UU-CS 2001-56). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences. Cheong, O. & Oostrum, R.W. van (2001). Reaching a Polygon with Directional Uncertainty. International journal of computational geometry & applications, 11. Oostrum, R.W. van (1999, May 31). Geometric algorithms for geographic information systems. Utrecht University (Utrecht, the Netherlands: Utrecht University). Prom./coprom.: prof. dr. M.H. Overmars & Prof.dr. M.J. van Kreveld. Bajaj, C., Kreveld, M.J. van & Oostrum, R.W. van (1998). Contour trees and small seed sets for isosurface traversal. (UU-CS 1998-25). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences. Aronov, B., Kreveld, M.J. van, Oostrum, R.W. van & Varadarajan, K. (1998). Facility location on terrains. In K.Y. Chwa & O.H. Ibarra (Eds.), Algorithms and Computation (ISAAC'98 Proceedings) (pp. 19-28). Berlin, Germany: Springer Verlag. 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. Kreveld, M.J. van, Oostrum, R.W. van, Bajaj, C., Pascucci, V. & Schikore, D. (1997). Contour trees and small seed sets for isosurface traversal. In Proceedings 13th Annual ACM Symposium on Computational Geometry (pp. 212-220). New York, U.S.A.: ACM Press. Kreveld, M.J. van, Oostrum, R.W. van & Snoeyink, J. (1997). Efficient settlement selection for interactive display. In Proceedings Auto-Carto 13: ACSM/ASPRS Annual Convention Technical Papers (pp. 287-296). Bethesda, MD, U.S.A.: ASPRS. Berg, M.T. de, Kreveld, M.J. van, Oostrum, R.W. van & Overmars, M.H. (1997). Simple traversal of a subdivision without extra storage. International Journal of Geographical Information Science, 11, 359-373. Berg, M.T. de, Kreveld, M.J. van, Oostrum, R.W. van & Overmars, M.H. (1996). Simple traversal of a subdivision without extra storage. (UU-CS 1996-17). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences. Berg, M.T. de, Oostrum, R.W. van & Overmars, M.H. (1996). Simple traversal of a subdivision without extra strorage, short communication. In Proceedings of the 12th ACM Symposium on Computational Geometry (pp. C5-C6). New York, U.S.A.: ACM Press.