home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by dr. H.J. Haverkort

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

dr. H.J. Haverkort

• contact information
• my technical reports
• former member of group games and virtual worlds

some publications

Cabello, S., Haverkort, H.J., Kreveld, M.J. van & Speckmann, B. (2010). Algorithmic Aspects of Proportional Symbol Maps. Algorithmica, 58(3), 543-565.

Cheong, J.S., Haverkort, H.J. & Stappen, A.F. van der (2006). On computing all immobilizing grasps of a simple polygon with few contacts. Algorithmica, 44, 117-136.

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).

Gudmundsson, J., Haverkort, H.J. & Kreveld, M.J. van (2005). Constrained higher order Delaunay triangulations. Comput. Geom. Theory & Appl., 30, 271-277.

Tanase, M., Veltkamp, R.C. & Haverkort, H.J. (2005). Multiple Polyline to Polygon Matching. In Proceedings 16th Annual Symposium on Algorithms and Computation (ISAAC) (pp. 60-70). Springer LNCS 3827.

Tanase, M., Veltkamp, R.C. & Haverkort, H.J. (2005). Multiple polyline to polygon matching. UU-CS 2005-017. onbekend: UU WINFI Informatica en Informatiekunde.

Gudmundsson, J., Haverkort, H.J. & Kreveld, M.J. van (2004). Constrained Higher Order Delaunay Triangulations. UU-CS 2004-007. Utrecht: Utrecht University: Information and Computing Sciences.

Cheong, J.S., Haverkort, H.J. & Stappen, A.F. van der (2004). On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. UU-CS 2004-13. Utrecht: Utrecht University: Information and Computing Sciences.

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.

Haverkort, H.J. (2004, May 17). Results on geometric networks and data structures. UU Universiteit Utrecht (184 pag.). Prom./coprom.: prof. dr. M.H. Overmars & dr. M.T. de Berg.

Berg, M.T. de & Haverkort, H.J. (2004). Significant-Presence Range Queries in Categorical Data. UU-CS 2004-009. Utrecht: Utrecht University: Information and Computing Sciences.

Arge, L., Berg, M.T. de, Haverkort, H.J. & Yi, K. (2004). The Priority R-Tree: a practically efficient and worst-case-optimal R-tree. UU-CS 2004-022. Utrecht: Utrecht University: Information and Computing Sciences.

Gudmundsson, J. G., Haverkort, H.J. & Kreveld, M.J. van (2003). Constraint Higher-Order Delaunay Triangulations. In 19th European Workshop on Computational Geometry CG 2003. Bonn: Institute of Computer Science I, University of Bonn.

Gudmundsson, J. G., Haverkort, H.J., Park, S.M., Shin, C.S. & Wolff, A. (2003). Facility Location and the Geometric Minimum-Diameter Spanning Tree. UU-CS 2003-006. Utrecht: Utrecht University: Information and Computing Sciences.

Berg, M.T. de & Haverkort, H.J. (2003). Significant-Presence Range Queries in Categorical Data. In F. Dehne, J.-R. Sack & M. Smid (Eds.), Algorithms and Data Structures 8th International Workshop WADS 2003. Berlin/Heidelberg/New York: Springer-Verlag.

Berg, M.T. de & Haverkort, H.J. (2003). Significant-Presence Range Queries in Categorical Data. In Significant-Presence Range Queries in Categorical Data. Bonn: Institute of Computer Science I, University of Bonn.

Gudmundsson, J. G., Haverkort, H.J., Park, S.M., Shin, C.S. & Wolff, A. (2002). Approximating the Geometric Minimum-Diameter Spanning Tree. In Proceedings of the 18th European Workshop on Computational Geometry (pp. 41-45). Warszawa.

Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2002). Box-Trees and R-Trees with Near-Optimal Query Time. Discrete and Computational Geometry, 28(3), 291-312.

Haverkort, H.J., Berg, M.T. de & Gudmundsson, J. G. (2002). Box-Trees for Collision Checking in Industrial Installations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 53-62). Barcelona, Spain.

Haverkort, H.J. & Berg, M.T. de (2002). Box-Trees for Collision Checking in Industrial Installations. UU-CS 2002-027. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Gudmundsson, J. G., Haverkort, H.J., Park, S.M., Shin, C.S. & Wolff, A. (2002). Facility Location and the Geometric Minimum-Diameter Spanning Tree. In et.al Jansen (Ed.), Approximation Algorithms for Combinatorial Optimization (APPROX) (pp. 146-160). Rome, Italy.

Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-Trees and R-Trees with Near-Optimal Query Time. UU-CS 2001-10. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-trees and R-trees with near-optimal query time. In R.L. Lagendijk, J.W.J. Heijnsdijk, A.D. Pimentel & M.H.F. Wilkinson (Eds.), ASCI: Proc. 7th Annual Conference of the Advanced School for Computing and Imaging (pp. 283-290). Delft: Advanced School for Computing and Imaging.

Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-trees and R-trees with near-optimal query time. In Proc. 17th ACM Symposium on Computational Geometry (pp. 124-133). New York: ACM.

Haverkort, H.J. & Bodlaender, H.L. (1999). Finding a minimal tree in a polygon with its medial axis. In 11th Canadian Conference on Computational Geometry, Vancouver.