René van Oostrum

Affiliations:
  • Utrecht University, Netherlands


According to our database1, René van Oostrum authored at least 24 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023

2017
Accelerating Matrix Processing with GPUs.
Proceedings of the 24th IEEE Symposium on Computer Arithmetic, 2017

2010
Flooding Countries and Destroying dams.
Int. J. Comput. Geom. Appl., 2010

2009
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.
Int. J. Comput. Geom. Appl., 2009

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Int. J. Comput. Geom. Appl., 2009

2007
Region Intervisibility in Terrains.
Int. J. Comput. Geom. Appl., 2007

Editorial.
Comput. Geom., 2007

2006
Guarding Art Galleries by Guarding Witnesses.
Int. J. Comput. Geom. Appl., 2006

A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004
Competitive facility location: the Voronoi game.
Theor. Comput. Sci., 2004

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons.
Discret. Comput. Geom., 2004

Parametric search made practical.
Comput. Geom., 2004

2003
Facility Location on a Polyhedral Surface.
Discret. Comput. Geom., 2003

Casting a polyhedron with directional uncertainty.
Comput. Geom., 2003

Using transportation distances for measuring melodic similarity.
Proceedings of the ISMIR 2003, 2003

2001
Reaching a Polygon with Directional Uncertainty.
Int. J. Comput. Geom. Appl., 2001

Competitive Facility Location along a Highway.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

1999
Geometric algorithms for geographic information systems.
PhD thesis, 1999

Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

The visibility region of points in a simple polygon.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Facility Location on Terrains.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
Simple Traversal of a Subdivision Without Extra Storage.
Int. J. Geogr. Inf. Sci., 1997

Contour Trees and Small Seed Sets for Isosurface Traversal.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Simple Traversal of a Subdivision Without Extra Storage.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996


  Loading...