| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Marc J. van Kreveld Marc J. van Kreveld, Iris Reinbacher , Avi Arampatzis , Roelof van Zwol : Multi-Dimensional Scattered Ranking Methods for Geographic Information Retrieval. GeoInformatica 9 (1): 61-84 (2005) Prosenjit Bose , Marc J. van Kreveld: Computing nice sweeps for polyhedra and polygons. CCCG 2004 : 108-111 Marc J. van Kreveld, A. Frank van der Stappen : Approximate Unions of Lines and Minkowski Sums. ESA 2004 : 448-459 Marc J. van Kreveld, Bettina Speckmann : On Rectangular Cartograms. ESA 2004 : 724-735 Marc J. van Kreveld, Étienne Schramm , Alexander Wolff : Algorithms for the placement of diagrams on maps. GIS 2004 : 222-231 Joachim Gudmundsson , Marc J. van Kreveld, Bettina Speckmann : Efficient detection of motion patterns in spatio-temporal data sets. GIS 2004 : 250-257 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) Sergio Cabello , Marc J. van Kreveld: Approximation algorithms for aligning points. Symposium on Computational Geometry 2003 : 20-28 Marc J. van Kreveld, Iris Reinbacher : Good NEWS: partitioning a simple polygon by compass directions. Symposium on Computational Geometry 2003 : 78-87 Sergio Cabello , Marc J. van Kreveld: Approximation Algorithms for Aligning Points. Algorithmica 37 (3): 211-232 (2003) 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) 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) Marc J. van Kreveld, Bettina Speckmann : Cutting a Country for Smallest Square Fit. ISAAC 2002 : 91-102 Christopher B. Jones , R. 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 Joachim Gudmundsson , Mikael Hammar , Marc J. van Kreveld: Higher order Delaunay triangulations. Comput. Geom. 23 (1): 85-98 (2002) Tycho Strijk , Marc J. van Kreveld: Practical Extensions of Point Labeling in the Slider Model. GeoInformatica 6 (2): 181-197 (2002) 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) 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 Marc J. van Kreveld: Guest Editor's Foreword. Algorithmica 30 (2): 141-143 (2001) Joachim Gudmundsson , Mikael Hammar , Marc J. van Kreveld: Higher Order Delaunay Triangulations. ESA 2000 : 232-243 Tycho Strijk , Marc J. van Kreveld: Practical Extensions of Point Labeling in the Slider Model. ACM-GIS 1999 : 47-52 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 Marc J. van Kreveld, Tycho Strijk , Alexander Wolff : Point labeling with sliding labels. Comput. Geom. 13 (1): 21-47 (1999) Tycho Strijk , Marc J. van Kreveld: Labeling a Rectilinear Map More Efficiently. Inf. Process. Lett. 69 (1): 25-30 (1999) Boris Aronov , Marc J. van Kreveld, René van Oostrum , Kasturi R. Varadarajan : Facility Location on Terrains. ISAAC 1998 : 19-28 Marc J. van Kreveld, Tycho Strijk , Alexander Wolff : Point Set Labeling with Sliding Labels. Symposium on Computational Geometry 1998 : 337-346 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) Marc J. van Kreveld: On fat partitioning, fat covering and the union size of polygons. Comput. Geom. 9 (4): 197-210 (1998) Prosenjit Bose , Marc J. van Kreveld, Godfried T. Toussaint : Filling polyhedral molds. Computer-Aided Design 30 (4): 245-254 (1998) 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) 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 Pankaj K. Agarwal , Marc J. van Kreveld, Subhash Suri : Label placement by maximum independent set in rectangles. CCCG 1997 Jack Snoeyink , Marc J. van Kreveld: Linear-Time Reconstruction of Delaunay Triangulations with Applications. ESA 1997 : 459-471 Marc J. van Kreveld: Algorithms for Triangulated Terrains. SOFSEM 1997 : 19-36 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 Jack Snoeyink , Marc J. van Kreveld: Good Orders for Incremental (Re)construction. Symposium on Computational Geometry 1997 : 400-402 Mark de Berg , Marc J. van Kreveld: Trekking in the Alps Without Freezing or Getting Tired. Algorithmica 18 (3): 306-323 (1997) Prosenjit Bose , David Bremner , Marc J. van Kreveld: Determining the Castability of Simple Polyhedra. Algorithmica 19 (1/2): 84-113 (1997) 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) 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) Marc J. van Kreveld: Digital Elevation Models and TIN Algorithms. Algorithmic Foundations of Geographic Information Systems 1996 : 37-78 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 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 Pankaj K. Agarwal , Marc J. van Kreveld: Connected Component and Simple Polygon Intersection Searching. Algorithmica 15 (6): 626-660 (1996) 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) Marc J. van Kreveld, Jack Snoeyink , Sue Whitesides : Folding Rulers Inside Triangles. Discrete & Computational Geometry 15 (3): 265-285 (1996) 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) Marc J. van Kreveld: Efficient Methods for Isoline Extraction from a TIN. International Journal of Geographical Information Science 10 (5): 523-540 (1996) 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- 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 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) Marc J. van Kreveld: On Quality Paths on Polyhedral Terrains. IGIS 1994 : 113-122 Prosenjit Bose , David Bremner , Marc J. van Kreveld: Determining the Castability of Simple Polyhedra. Symposium on Computational Geometry 1994 : 123-131 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) Marc J. van Kreveld, Mark H. Overmars : Concatenable Structures for Decomposable Problems Inf. Comput. 110 (1): 130-148 (1994) Mark de Berg , Marc J. van Kreveld: Rectilinear Decompositions with Low Stabbing Number. Inf. Process. Lett. 52 (4): 215-221 (1994) 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) Marc J. van Kreveld, Jack Snoeyink , Sue Whitesides : Folding Rulers inside Triangles. CCCG 1993 : 1-6 Mark de Berg , Marc J. van Kreveld: Trekking in the Alps Without Freezing or Getting Tired. ESA 1993 : 121-132 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 Prosenjit Bose , Marc J. van Kreveld, Godfried T. Toussaint : Filling Polyhedral Molds. WADS 1993 : 210-221 Pankaj K. Agarwal , Marc J. van Kreveld: Connected Component and Simple Polygon Intersection Searching (Extended Abstract). WADS 1993 : 36-47 Marc J. van Kreveld: On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract). WADS 1993 : 452-463 Marc J. van Kreveld: The Power of Parallel Projection. Inf. Process. Lett. 46 (4): 185-191 (1993) Marc J. van Kreveld, Mark H. Overmars : Union-Copy Structures and Dynamic Segment Trees. J. ACM 40 (3): 635-652 (1993) Pankaj K. Agarwal , Marc J. van Kreveld, Mark H. Overmars : Intersection Queries in Curved Objects. J. Algorithms 15 (2): 229-266 (1993) 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 Mark de Berg , Marc J. van Kreveld, Jack Snoeyink : Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992 : 352-363 Marc J. van Kreveld, Mark H. Overmars , Pankaj K. Agarwal : Intersection Queries in Sets of Disks. BIT 32 (2): 268-279 (1992) 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) 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 Pankaj K. Agarwal , Marc J. van Kreveld, Mark H. Overmars : Intersection Queries for Curved Objects (Extended Abstract). Symposium on Computational Geometry 1991 : 41-50 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 Marc J. van Kreveld, Mark H. Overmars : Divided k-d Trees. Algorithmica 6 (6): 840-858 (1991) Marc J. van Kreveld, Mark de Berg : Finding Squares and Rectangles in Sets of Points. BIT 31 (2): 202-219 (1991) 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 Marc J. van Kreveld, Mark H. Overmars , Pankaj K. Agarwal : Intersection Queries in Sets of Disks. SWAT 1990 : 393-403 Marc J. van Kreveld, Mark H. Overmars : Concatenable Segment Trees (Extended Abstract). STACS 1989 : 493-504 Marc J. van Kreveld, Mark de Berg : Finding Squares and Rectangles in Sets of Points. WG 1989 : 341-355 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) 1 [ 4 ] [ 9 ] [ 12 ] [ 14 ] [ 15 ] [ 19 ] [ 24 ] [ 37 ] [ 49 ] [ 54 ] 2 [ 80 ] 3 [ 56 ] [ 69 ] 4 [ 46 ] 5 [ 1 ] [ 2 ] [ 5 ] [ 6 ] [ 8 ] [ 10 ] [ 11 ] [ 13 ] [ 22 ] [ 25 ] [ 27 ] [ 30 ] [ 32 ] [ 36 ] [ 38 ] [ 39 ] [ 41 ] [ 42 ] [ 44 ] [ 51 ] [ 63 ] 6 [ 20 ] [ 28 ] [ 39 ] [ 43 ] [ 52 ] [ 70 ] [ 79 ] 7 [ 28 ] [ 43 ] 8 [ 63 ] [ 71 ] [ 73 ] 9 [ 51 ] 10 [ 38 ] [ 51 ] 11 [ 63 ] [ 64 ] 12 [ 39 ] 13 [ 21 ] [ 34 ] 14 [ 39 ] 15 [ 61 ] [ 66 ] [ 75 ] 16 [ 10 ] [ 27 ] [ 42 ] 17 [ 61 ] [ 66 ] 18 [ 67 ] 19 [ 31 ] 20 [ 70 ] 21 [ 59 ] 22 [ 70 ] 23 [ 70 ] 24 [ 50 ] 25 [ 5 ] [ 8 ] [ 11 ] 26 [ 32 ] [ 41 ] [ 46 ] [ 56 ] [ 69 ] 27 [ 1 ] [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 15 ] [ 16 ] [ 26 ] [ 27 ] [ 31 ] [ 32 ] [ 39 ] [ 41 ] [ 42 ] 28 [ 46 ] 29 [ 67 ] 30 [ 72 ] [ 74 ] [ 80 ] 31 [ 21 ] [ 34 ] 32 [ 39 ] [ 50 ] 33 [ 59 ] 34 [ 67 ] 35 [ 67 ] 36 [ 46 ] 37 [ 76 ] 38 [ 36 ] [ 38 ] 39 [ 67 ] 40 [ 59 ] 41 [ 1 ] 42 [ 10 ] [ 13 ] [ 23 ] [ 27 ] [ 30 ] [ 35 ] [ 36 ] [ 39 ] [ 45 ] [ 48 ] [ 59 ] 43 [ 59 ] [ 68 ] [ 75 ] [ 77 ] 44 [ 78 ] 45 [ 55 ] [ 57 ] [ 58 ] [ 60 ] [ 63 ] [ 64 ] [ 65 ] 46 [ 49 ] [ 54 ] 47 [ 38 ] [ 51 ] 48 [ 20 ] [ 52 ] 49 [ 56 ] [ 69 ] 50 [ 67 ] 51 [ 23 ] [ 35 ] 52 [ 50 ] 53 [ 55 ] [ 58 ] [ 64 ] [ 76 ] 54 [ 39 ] 55 [ 80 ]  ©2005 Association for Computing Machinery |
