Other themes: Automated cartography - Terrains & triangulations - Computational geometry - Miscellaneous
New results on data structures in computational
geometry.
M. van Kreveld. PhD dissertation, Utrecht
University, 1992.
Intersection queries in sets of disks.
M. van Kreveld, M. Overmars, and P. K.
Agarwal. BIT, 32:268--279, 1992.
Intersection queries in curved objects.
Pankaj K. Agarwal, M. van Kreveld, and
M. Overmars. J. Algorithms, 15:229--266, 1993.
Connected component and simple polygon
intersection searching. TR
P.K. Agarwal and M. van Kreveld. Algorithmica,
15: 626--660, 1996.
Divided k-d trees.
M.J. van Kreveld and M.H. Overmars. Algorithmica,
6:840--858, 1991.
Union-copy structures and dynamic segment
trees.
M. van Kreveld and M. Overmars. J. ACM,
40:635--652, 1993.
Concatenable structures for decomposable
problems.
M.J. van Kreveld and M.H. Overmars. Information
and Computation, 110:130--148, 1994.
Maintaining range trees in secondary
memory, part I: partitions.
M.H. Overmars, M.H.M. Smid, M.T. de Berg,
and M.J. van Kreveld. Acta Inform., 27:423--452, 1990.
Shortest path queries in rectilinear
worlds.
M. de Berg, M. van Kreveld, B.J. Nilsson,
and M.H. Overmars. Int. J. Comp. Geom. & Appl. 2:287--309, 1992.
Efficient ray shooting and hidden surface
removal.
M. de Berg, D. Halperin, M. Overmars,
J. Snoeyink, and M. van Kreveld. Algorithmica, 12:30--53, 1994.
Two- and three-dimensional point location
in rectangular subdivisions.
M. de Berg, M. van Kreveld, and J. Snoeyink.
J. Algorithms, 18:256--277, 1995.
Point location in zones of k-flats in
arrangements.
M. de Berg, M. van Kreveld, O. Schwarzkopf,
and J. Snoeyink. Comput. Geom. Theory Appl., 6:131--143, 1996.