Other themes: Automated cartography - Terrains & triangulations - Geometric data structures - Miscellaneous
Determining the castability of simple
polyhedra. TR
P. Bose, D. Bremner, and M. van Kreveld.
Algorithmica, 19:84--113, 1997.
Filling polyhedral molds.
P. Bose, M. van Kreveld, and G. Toussaint.
Comput. Aided Design, 30(4):245--254, April 1998.
Finding complete bipartite subgraphs
in bipartite graphs.
M. de Berg, M. Overmars, and M. van Kreveld.
Algorithms Review, 1(2):79--85, 1990.
Finding squares and rectangles in sets
of points.
M.J. van Kreveld and M.T. de Berg. BIT,
31:202--219, 1991.
The power of parallel projection.
M. van Kreveld. Inform. Process. Lett.,
46:185--191, 1993.
Rectilinear decompositions with low
stabbing number.
M. de Berg and M. van Kreveld. Inform.
Process. Lett., 52:215--221, 1994.
An optimal algorithm for the (<=
k)-levels, with applications to separation and transversal problems.
H. Everett, J.-M. Robert, and M. van Kreveld.
Int. J. Comp. Geom. & Appl., 6:247--261, 1996.
Folding rulers inside triangles. TR
M. van Kreveld, J. Snoeyink, and S. Whitesides.
Discrete Comput. Geom., 15:265--285, 1996.
Sparse arrangements and the number of
views of polyhedral scenes.
M. de Berg, D. Halperin, M. Overmars,
and M. van Kreveld. Int. J. of Comp. Geom. & Appl., 7:175--195, 1997.
Simple traversal of a subdivision without
extra storage. TR
M. de Berg, M. van Kreveld, R. van Oostrum,
and M. Overmars. Int. J. of GIS, 11:359--373, 1997.
Computing the maximum overlap of two
convex polygons under translations.
M. de Berg, O. Cheong, O. Devillers, M.
van Kreveld, and M. Teillaud. Theory of Computing Systems, pages 613--628,
1998.
On fat partitioning, fat covering and
the union size of polygons.
M. van Kreveld. Comput. Geom. Theory Appl.,
9:197--210, 1998.
Efficient algorithms for maximum regression
depth.
M. van Kreveld, J.S.B. Mitchell, P. Rousseeuw,
M. Sharir, J. Snoeyink, and B. Speckmann. In Proc. 15th Annu. ACM Sympos.
Comput. Geom., pages 31--40, 1999.