| 2009 | ||
|---|---|---|
| 133 | Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Jun Luo: Finding long and similar parts of trajectories. GIS 2009: 296-305 | |
| 132 | Marc J. van Kreveld, Rodrigo I. Silveira: Embedding rivers in polyhedral terrains. Symposium on Computational Geometry 2009: 169-178 | |
| 131 | Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann: Connect the Dot: Computing Feed-Links with Minimum Dilation. WADS 2009: 49-60 | |
| 130 | Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-restricted clustering for geographic data mining. Comput. Geom. 42(3): 231-240 (2009) | |
| 129 | Rodrigo I. Silveira, Marc J. van Kreveld: Towards a definition of higher order constrained Delaunay triangulations. Comput. Geom. 42(4): 322-337 (2009) | |
| 128 | Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann: Matched Drawings of Planar Graphs. J. Graph Algorithms Appl. 13(3): 423-445 (2009) | |
| 127 | Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel: Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. 44(2): 160-174 (2009) | |
| 2008 | ||
| 126 | Boris Aronov, Kevin Buchin, Maike Buchin, B. Jansen, T. de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann: Feed-links for network extensions. GIS 2008: 35 | |
| 125 | Sjoerd van Hagen, Marc J. van Kreveld: Placing Text Boxes on Graphs. Graph Drawing 2008: 284-295 | |
| 124 | Michael Kaufmann, Marc J. van Kreveld, Bettina Speckmann: Subdivision Drawings of Hypergraphs. Graph Drawing 2008: 396-407 | |
| 123 | Marc J. van Kreveld, Maarten Löffler, Joseph S. B. Mitchell: Preprocessing Imprecise Points and Splitting Triangulations. ISAAC 2008: 544-555 | |
| 122 | Rodrigo I. Silveira, Marc J. van Kreveld: Optimal Higher Order Delaunay Triangulations of Polygons. LATIN 2008: 133-145 | |
| 121 | Patrick Laube, Mark de Berg, Marc J. van Kreveld: Spatial Support and Spatial Confidencefor Spatial Association Rules. SDH 2008: 575-593 | |
| 120 | Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira: Clusters in Aggregated Health Data. SDH 2008: 77-90 | |
| 119 | Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff: Delineating Boundaries for Imprecise Regions. Algorithmica 50(3): 386-414 (2008) | |
| 118 | Esther Moet, Christian Knauer, Marc J. van Kreveld: Visibility maps of segments and triangles in 3D. Comput. Geom. 39(3): 163-177 (2008) | |
| 117 | Esther Moet, Marc J. van Kreveld, A. Frank van der Stappen: On realistic terrains. Comput. Geom. 41(1-2): 48-67 (2008) | |
| 116 | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Discrete & Computational Geometry 39(4): 656-677 (2008) | |
| 115 | Marc J. van Kreveld, Maarten Löffler: Approximating largest convex hulls for imprecise points. J. Discrete Algorithms 6(4): 583-594 (2008) | |
| 2007 | ||
| 114 | Rodrigo I. Silveira, Marc J. van Kreveld: Towards a Definition of Higher Order Constrained Delaunay Triangulations. CCCG 2007: 161-164 | |
| 113 | Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Largest Subsets of Triangles in a Triangulation. CCCG 2007: 213-216 | |
| 112 | Marc J. van Kreveld, Bettina Speckmann: On the Number of Empty Pseudo-Triangles in Point Sets. CCCG 2007: 37-40 | |
| 111 | Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel: Wooden Geometric Puzzles: Design and Hardness Proofs. FUN 2007: 16-29 | |
| 110 | Marc J. van Kreveld, Jun Luo: The definition and computation of trajectory and subtrajectory similarity. GIS 2007: 44 | |
| 109 | Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann: Matched Drawings of Planar Graphs. Graph Drawing 2007: 183-194 | |
| 108 | Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo: Geodesic Disks and Clustering in a Simple Polygon. ISAAC 2007: 656-667 | |
| 107 | Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Optimization for First Order Delaunay Triangulations. WADS 2007: 175-187 | |
| 106 | Maarten Löffler, Marc J. van Kreveld: Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points. WADS 2007: 446-457 | |
| 105 | David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann: Edges and Switches, Tunnels and Bridges. WADS 2007: 77-88 | |
| 104 | Maarten Löffler, Marc J. van Kreveld: Approximating Largest Convex Hulls for Imprecise Points. WAOA 2007: 89-102 | |
| 103 | David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann: Edges and Switches, Tunnels and Bridges CoRR abs/0705.0413: (2007) | |
| 102 | Thierry de Kok, Marc J. van Kreveld, Maarten Löffler: Generating realistic terrains with higher-order Delaunay triangulations. Comput. Geom. 36(1): 52-65 (2007) | |
| 101 | Marc J. van Kreveld, Bettina Speckmann: On rectangular cartograms. Comput. Geom. 37(3): 175-187 (2007) | |
| 100 | Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Efficient Detection of Patterns in 2D Trajectories of Moving Points. GeoInformatica 11(2): 195-215 (2007) | |
| 99 | Esther Moet, Marc J. van Kreveld, René van Oostrum: Region Intervisibility in Terrains. Int. J. Comput. Geometry Appl. 17(4): 331-347 (2007) | |
| 2006 | ||
| 98 | Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan: Region-Restricted Clustering for Geographic Data Mining. ESA 2006: 399-410 | |
| 97 | Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann: Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731 | |
| 96 | Joachim Gudmundsson, Marc J. van Kreveld: Computing longest duration flocks in trajectory data. GIS 2006: 35-42 | |
| 95 | Joachim Gudmundsson, Marc J. van Kreveld, Damian Merrick: Schematisation of Tree Drawings. Graph Drawing 2006: 66-76 | |
| 94 | Esther Moet, Christian Knauer, Marc J. van Kreveld: Visibility Maps of Segments and Triangles in 3D. ICCSA (1) 2006: 20-29 | |
| 93 | Maarten Löffler, Marc J. van Kreveld: Largest and Smallest Tours and Convex Hulls for Imprecise Points. SWAT 2006: 375-387 | |
| 92 | Esther Moet, Marc J. van Kreveld, A. Frank van der Stappen: On realistic terrains. Symposium on Computational Geometry 2006: 177-186 | |
| 91 | Marc J. van Kreveld, A. Frank van der Stappen: Approximate Unions of Lines and Minkowski Sums. Algorithmica 45(1): 91-107 (2006) | |
| 90 | Avi T. Arampatzis, Marc J. van Kreveld, Iris Reinbacher, Christopher B. Jones, Subodh Vaid, Paul Clough, Hideo Joho, Mark Sanderson: Web-based delineation of imprecise regions. Computers, Environment and Urban Systems 30(4): 436-459 (2006) | |
| 89 | Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Area-preserving approximations of polygonal paths. J. Discrete Algorithms 4(4): 554-566 (2006) | |
| 2005 | ||
| 88 | Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff: Delineating Boundaries for Imprecise Regions. ESA 2005: 143-154 | |
| 87 | Thierry de Kok, Marc J. van Kreveld, Maarten Löffler: Generating Realistic Terrains with Higher-Order Delaunay Triangulations. ESA 2005: 343-354 | |
| 86 | Thierry de Kok, Marc J. van Kreveld, Maarten Löffler: Minimizing local minima in terrains with higher-order Delaunay triangulations. EuroCG 2005: 115-118 | |
| 85 | Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Alexander Wolff: Delineating boundaries for imprecise regions. EuroCG 2005: 127-130 | |
| 84 | Sander Florisson, Marc J. van Kreveld, Bettina Speckmann: Rectangular cartograms: construction & animation. Symposium on Computational Geometry 2005: 372-373 | |
| 83 | Sergio Cabello, Mark de Berg, Marc J. van Kreveld: Schematization of networks. Comput. Geom. 30(3): 223-228 (2005) | |
| 82 | Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld: Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005) | |
| 81 | Marc J. van Kreveld, Iris Reinbacher, Avi T. Arampatzis, Roelof van Zwol: Multi-Dimensional Scattered Ranking Methods for Geographic Information Retrieval. GeoInformatica 9(1): 61-84 (2005) | |
| 80 | Prosenjit Bose, Marc J. van Kreveld: Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra. Int. J. Comput. Geometry Appl. 15(6): 591-608 (2005) | |
| 2004 | ||
| 79 | Prosenjit Bose, Marc J. van Kreveld: Computing nice sweeps for polyhedra and polygons. CCCG 2004: 108-111 | |
| 78 | Marc J. van Kreveld, A. Frank van der Stappen: Approximate Unions of Lines and Minkowski Sums. ESA 2004: 448-459 | |
| 77 | Marc J. van Kreveld, Bettina Speckmann: On Rectangular Cartograms. ESA 2004: 724-735 | |
| 76 | Marc J. van Kreveld, Étienne Schramm, Alexander Wolff: Algorithms for the placement of diagrams on maps. GIS 2004: 222-231 | |
| 75 | Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann: Efficient detection of motion patterns in spatio-temporal data sets. GIS 2004: 250-257 | |
| 74 | Marc J. van Kreveld, Iris Reinbacher: Good news: Partitioning a simple polygon by compass directions. Int. J. Comput. Geometry Appl. 14(4-5): 233-259 (2004) | |
| 2003 | ||
| 73 | Sergio Cabello, Marc J. van Kreveld: Approximation algorithms for aligning points. Symposium on Computational Geometry 2003: 20-28 | |
| 72 | Marc J. van Kreveld, Iris Reinbacher: Good NEWS: partitioning a simple polygon by compass directions. Symposium on Computational Geometry 2003: 78-87 | |
| 71 | Sergio Cabello, Marc J. van Kreveld: Approximation Algorithms for Aligning Points. Algorithmica 37(3): 211-232 (2003) | |
| 70 | Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison: Translating a regular grid over a point set. Comput. Geom. 25(1-2): 21-34 (2003) | |
| 69 | Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan: Facility Location on a Polyhedral Surface. Discrete & Computational Geometry 30(3): 357-372 (2003) | |
| 2002 | ||
| 68 | Marc J. van Kreveld, Bettina Speckmann: Cutting a Country for Smallest Square Fit. ISAAC 2002: 91-102 | |
| 67 | Christopher B. Jones, Ross Purves, Anne Ruas, Mark Sanderson, Monika Sester, Marc J. van Kreveld, Robert Weibel: Spatial information retrieval and geographical ontologies an overview of the SPIRIT project. SIGIR 2002: 387-388 | |
| 66 | Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher order Delaunay triangulations. Comput. Geom. 23(1): 85-98 (2002) | |
| 65 | Tycho Strijk, Marc J. van Kreveld: Practical Extensions of Point Labeling in the Slider Model. GeoInformatica 6(2): 181-197 (2002) | |
| 64 | Steven van Dijk, Marc J. van Kreveld, Tycho Strijk, Alexander Wolff: Towards an evaluation of quality for names placement methods. International Journal of Geographical Information Science 16(7): 641-661 (2002) | |
| 2001 | ||
| 63 | Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk: Schematization of road networks. Symposium on Computational Geometry 2001: 33-39 | |
| 62 | Marc J. van Kreveld: Guest Editor's Foreword. Algorithmica 30(2): 141-143 (2001) | |
| 2000 | ||
| 61 | Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher Order Delaunay Triangulations. ESA 2000: 232-243 | |
| 1999 | ||
| 60 | Tycho Strijk, Marc J. van Kreveld: Practical Extensions of Point Labeling in the Slider Model. ACM-GIS 1999: 47-52 | |
| 59 | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Symposium on Computational Geometry 1999: 31-40 | |
| 58 | Marc J. van Kreveld, Tycho Strijk, Alexander Wolff: Point labeling with sliding labels. Comput. Geom. 13(1): 21-47 (1999) | |
| 57 | Tycho Strijk, Marc J. van Kreveld: Labeling a Rectilinear Map More Efficiently. Inf. Process. Lett. 69(1): 25-30 (1999) | |
| 1998 | ||
| 56 | Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan: Facility Location on Terrains. ISAAC 1998: 19-28 | |
| 55 | Marc J. van Kreveld, Tycho Strijk, Alexander Wolff: Point Set Labeling with Sliding Labels. Symposium on Computational Geometry 1998: 337-346 | |
| 54 | Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3-4): 209-218 (1998) | |
| 53 | Marc J. van Kreveld: On fat partitioning, fat covering and the union size of polygons. Comput. Geom. 9(4): 197-210 (1998) | |
| 52 | Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint: Filling polyhedral molds. Computer-Aided Design 30(4): 245-254 (1998) | |
| 51 | Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud: Computing the Maximum Overlap of Two Convex Polygons under Translations. Theory Comput. Syst. 31(5): 613-628 (1998) | |
| 1997 | ||
| 50 | Marc J. van Kreveld, Jürg Nievergelt, Thomas Roos, Peter Widmayer: Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems, Udine, Italy, September 16-20, 1996 Springer 1997 | |
| 49 | Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri: Label placement by maximum independent set in rectangles. CCCG 1997 | |
| 48 | Jack Snoeyink, Marc J. van Kreveld: Linear-Time Reconstruction of Delaunay Triangulations with Applications. ESA 1997: 459-471 | |
| 47 | Marc J. van Kreveld: Algorithms for Triangulated Terrains. SOFSEM 1997: 19-36 | |
| 46 | Marc J. van Kreveld, René van Oostrum, Chandrajit L. Bajaj, Valerio Pascucci, Daniel Schikore: Contour Trees and Small Seed Sets for Isosurface Traversal. Symposium on Computational Geometry 1997: 212-220 | |
| 45 | Jack Snoeyink, Marc J. van Kreveld: Good Orders for Incremental (Re)construction. Symposium on Computational Geometry 1997: 400-402 | |
| 44 | Mark de Berg, Marc J. van Kreveld: Trekking in the Alps Without Freezing or Getting Tired. Algorithmica 18(3): 306-323 (1997) | |
| 43 | Prosenjit Bose, David Bremner, Marc J. van Kreveld: Determining the Castability of Simple Polyhedra. Algorithmica 19(1/2): 84-113 (1997) | |
| 42 | Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld: Sparse Arrangements and the Number of Views of Polyhedral Scenes. Int. J. Comput. Geometry Appl. 7(3): 175-195 (1997) | |
| 41 | Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars: Simple Traversal of a Subdivision Without Extra Storage. International Journal of Geographical Information Science 11(4): 359-373 (1997) | |
| 1996 | ||
| 40 | Marc J. van Kreveld: Digital Elevation Models and TIN Algorithms. Algorithmic Foundations of Geographic Information Systems 1996: 37-78 | |
| 39 | Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu: The Complexity of Rivers in Triangulated Terrains. CCCG 1996: 325-330 | |
| 38 | Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud: Computing the Maximum Overlap of Two Convex Polygons Under Translations. ISAAC 1996: 126-135 | |
| 37 | Pankaj K. Agarwal, Marc J. van Kreveld: Connected Component and Simple Polygon Intersection Searching. Algorithmica 15(6): 626-660 (1996) | |
| 36 | Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink: Point Location in Zones of K-flats in Arrangements. Comput. Geom. 6: 131-143 (1996) | |
| 35 | Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides: Folding Rulers Inside Triangles. Discrete & Computational Geometry 15(3): 265-285 (1996) | |
| 34 | Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld: An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems. Int. J. Comput. Geometry Appl. 6(3): 247-261 (1996) | |
| 33 | Marc J. van Kreveld: Efficient Methods for Isoline Extraction from a TIN. International Journal of Geographical Information Science 10(5): 523-540 (1996) | |
| 1995 | ||
| 32 | Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars: Simple Traversal of a Subdivision Without Extra Storage. ACM-GIS 1995: 77- | |
| 31 | Berto van de Kraats, Marc J. van Kreveld, Mark H. Overmars: Printed Circuit Board Simplification: Simplifying Subdivisions in Practice. Symposium on Computational Geometry 1995: C30-C31 | |
| 30 | Mark de Berg, Marc J. van Kreveld, Jack Snoeyink: Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms 18(2): 256-277 (1995) | |
| 1994 | ||
| 29 | Marc J. van Kreveld: On Quality Paths on Polyhedral Terrains. IGIS 1994: 113-122 | |
| 28 | Prosenjit Bose, David Bremner, Marc J. van Kreveld: Determining the Castability of Simple Polyhedra. Symposium on Computational Geometry 1994: 123-131 | |
| 27 | Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Algorithmica 12(1): 30-53 (1994) | |
| 26 | Marc J. van Kreveld, Mark H. Overmars: Concatenable Structures for Decomposable Problems Inf. Comput. 110(1): 130-148 (1994) | |
| 25 | Mark de Berg, Marc J. van Kreveld: Rectilinear Decompositions with Low Stabbing Number. Inf. Process. Lett. 52(4): 215-221 (1994) | |
| 24 | Pankaj K. Agarwal, Marc J. van Kreveld: Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. Int. J. Comput. Geometry Appl. 4(4): 369-383 (1994) | |
| 1993 | ||
| 23 | Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides: Folding Rulers inside Triangles. CCCG 1993: 1-6 | |
| 22 | Mark de Berg, Marc J. van Kreveld: Trekking in the Alps Without Freezing or Getting Tired. ESA 1993: 121-132 | |
| 21 | Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld: An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems. Symposium on Computational Geometry 1993: 38-46 | |
| 20 | Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint: Filling Polyhedral Molds. WADS 1993: 210-221 | |
| 19 | Pankaj K. Agarwal, Marc J. van Kreveld: Connected Component and Simple Polygon Intersection Searching (Extended Abstract). WADS 1993: 36-47 | |
| 18 | Marc J. van Kreveld: On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract). WADS 1993: 452-463 | |
| 17 | Marc J. van Kreveld: The Power of Parallel Projection. Inf. Process. Lett. 46(4): 185-191 (1993) | |
| 16 | Marc J. van Kreveld, Mark H. Overmars: Union-Copy Structures and Dynamic Segment Trees. J. ACM 40(3): 635-652 (1993) | |
| 15 | Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars: Intersection Queries in Curved Objects. J. Algorithms 15(2): 229-266 (1993) | |
| 1992 | ||
| 14 | Pankaj K. Agarwal, Marc J. van Kreveld: Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. FSTTCS 1992: 80-91 | |
| 13 | Mark de Berg, Marc J. van Kreveld, Jack Snoeyink: Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992: 352-363 | |
| 12 | Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal: Intersection Queries in Sets of Disks. BIT 32(2): 268-279 (1992) | |
| 11 | Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars: Shortest path queries in rectilinear worlds. Int. J. Comput. Geometry Appl. 2(3): 287-309 (1992) | |
| 1991 | ||
| 10 | Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld: Efficient Ray Shooting and Hidden Surface Removal. Symposium on Computational Geometry 1991: 21-30 | |
| 9 | Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars: Intersection Queries for Curved Objects (Extended Abstract). Symposium on Computational Geometry 1991: 41-50 | |
| 8 | Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson: Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). Symposium on Computational Geometry 1991: 51-60 | |
| 7 | Marc J. van Kreveld, Mark H. Overmars: Divided k-d Trees. Algorithmica 6(6): 840-858 (1991) | |
| 6 | Marc J. van Kreveld, Mark de Berg: Finding Squares and Rectangles in Sets of Points. BIT 31(2): 202-219 (1991) | |
| 1990 | ||
| 5 | Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars: Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. SWAT 1990: 213-224 | |
| 4 | Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal: Intersection Queries in Sets of Disks. SWAT 1990: 393-403 | |
| 1989 | ||
| 3 | Marc J. van Kreveld, Mark H. Overmars: Concatenable Segment Trees (Extended Abstract). STACS 1989: 493-504 | |
| 2 | Marc J. van Kreveld, Mark de Berg: Finding Squares and Rectangles in Sets of Points. WG 1989: 341-355 | |
| 1 | Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld: Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Inf. 27(5): 423-452 (1989) | |