The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Marc J. van Kreveld: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  107. Blocking delaunay triangulations. [Citation Graph (, )][DBLP]


  108. Bold Graph Drawings. [Citation Graph (, )][DBLP]


  109. Embedding rivers in polyhedral terrains. [Citation Graph (, )][DBLP]


  110. Computing similarity between piecewise-linear functions. [Citation Graph (, )][DBLP]


  111. Median Trajectories. [Citation Graph (, )][DBLP]


  112. Delineating boundaries for imprecise regions. [Citation Graph (, )][DBLP]


  113. Minimizing local minima in terrains with higher-order Delaunay triangulations. [Citation Graph (, )][DBLP]


  114. Placing Text Boxes on Graphs. [Citation Graph (, )][DBLP]


  115. Subdivision Drawings of Hypergraphs. [Citation Graph (, )][DBLP]


  116. Geometric Simultaneous Embeddings of a Graph and a Matching. [Citation Graph (, )][DBLP]


  117. Matched Drawings of Planar Graphs. [Citation Graph (, )][DBLP]


  118. On Planar Supports for Hypergraphs. [Citation Graph (, )][DBLP]


  119. The definition and computation of trajectory and subtrajectory similarity. [Citation Graph (, )][DBLP]


  120. Finding long and similar parts of trajectories. [Citation Graph (, )][DBLP]


  121. Feed-links for network extensions. [Citation Graph (, )][DBLP]


  122. Preprocessing Imprecise Points and Splitting Triangulations. [Citation Graph (, )][DBLP]


  123. Geodesic Disks and Clustering in a Simple Polygon. [Citation Graph (, )][DBLP]


  124. Optimal Higher Order Delaunay Triangulations of Polygons. [Citation Graph (, )][DBLP]


  125. Connect the Dot: Computing Feed-Links with Minimum Dilation. [Citation Graph (, )][DBLP]


  126. Approximating Largest Convex Hulls for Imprecise Points. [Citation Graph (, )][DBLP]


  127. Spatial Support and Spatial Confidencefor Spatial Association Rules. [Citation Graph (, )][DBLP]


  128. Clusters in Aggregated Health Data. [Citation Graph (, )][DBLP]


  129. Delineating Boundaries for Imprecise Regions. [Citation Graph (, )][DBLP]


  130. Largest and Smallest Convex Hulls for Imprecise Points. [Citation Graph (, )][DBLP]


  131. Visibility maps of segments and triangles in 3D. [Citation Graph (, )][DBLP]


  132. On realistic terrains. [Citation Graph (, )][DBLP]


  133. Towards a definition of higher order constrained Delaunay triangulations. [Citation Graph (, )][DBLP]


  134. Region-restricted clustering for geographic data mining. [Citation Graph (, )][DBLP]


  135. Edges and switches, tunnels and bridges. [Citation Graph (, )][DBLP]


  136. Optimal higher order Delaunay triangulations of polygons. [Citation Graph (, )][DBLP]


  137. Largest bounding box, smallest diameter, and related problems on imprecise points. [Citation Graph (, )][DBLP]


  138. Optimization for first order Delaunay triangulations. [Citation Graph (, )][DBLP]


  139. Efficient Algorithms for Maximum Regression Depth. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002