Kreveld, M.J. van (2011). Bold graph drawings. Comput. Geom., 44(9), 499-506.
|
Kreveld, M.J. van & Silveira, R.I. (2011). Embedding rivers in triangulated irregular networks with linear programming. International Journal of Geographical Information Science, 25(4), 615-631.
|
Buchin, K.A., Buchin- Walther, M., Kreveld, M.J. van & Luo, J. (2011). Finding long and similar parts of trajectories. Comput. Geom., 44(9), 465-476.
|
Lankveld, T. van, Kreveld, M.J. van & Veltkamp, R.C. (2011). Identifying rectangles in laser range data for urban scene reconstruction. Computers & Graphics, 35(3), 719-725.
|
Kreveld, M.J. van, Lankveld, T. van & Veltkamp, R.C. (2011). On the shape of a set of points and lines in the plane. Comput. Graph. Forum, 30(5), 1553-1562.
|
Aronov, B., Kreveld, M.J. van, Loeffler, M. & Silveira, R.I. (2011). Peeling Meshed Potatoes. Algorithmica, 60(2), 349-367.
|
Kreveld, M.J. van (2011). The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs. In Graph Drawing, 18th International Symposium, GD 2010 (pp. 371-376). Springer.
|
Cabello, S., Haverkort, H.J., Kreveld, M.J. van & Speckmann, B. (2010). Algorithmic Aspects of Proportional Symbol Maps. Algorithmica, 58(3), 543-565.
|
Buchin- Walther, M., Driemel, A., Kreveld, M.J. van & Sacristan, V. (2010). An algorithmic framework for segmenting trajectories based on spatio-temporal criteria. In D. Agrawal, P. Zhang, A.E. Abbadi & M.F. Mokbel (Eds.), 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2010, November 3-5, 2010, San Jose, CA, USA, Proceedings (pp. 202-211). ACM.
|
Aichholzer, O., Fabila Monroy, R., Hackl, T., Pilz, A., Ramos, P., Kreveld, M.J. van & Vogtenhuber, B. (2010). Blocking Delaunay triangulations. In Proc. 22nd Canadian Conference on Computational Geometry (pp. 21-24).
|
Agarwal, P.K., Aronov, B., Kreveld, M.J. van, Loeffler, M. & Silveira, R.I. (2010). Computing Similarity between Piecewise-Linear Functions. In Proc. 26th ACM Symposium on Computational Geometry (pp. 375-383).
|
Fabrikant, S.I., Reichenbacher, T., Kreveld, M.J. van & Schlieder, C. (Eds.). (2010). Geographic Information Science, 6th International Conference, Proceedings (Lecture Notes in Computer Science, 6292). Springer.
|
S. Cabello, S., Kreveld, M.J. van, Liotta, G., Meijer, H., Speckmann, B. & Verbeek, K. (2010). Geometric simultaneous embeddings of a graph and a matching. In Graph Drawing, 17th International Symposium, GD 2009 (pp. 183-194). Springer.
|
Loeffler, M. & Kreveld, M.J. van (2010). Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica, 56(2), 235-269.
|
Loeffler, M. & Kreveld, M.J. van (2010). Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom., 43(4), 419-433.
|
Buchin, K.A., Buchin- Walther, M., Kreveld, M.J. van, Loeffler, M., Silveira, R.I., Wenk, C. & Wiratma, L. (2010). Median Trajectories. In Algorithms - ESA 2010, 18th Annual European Symposium, Proceedings, Part I (pp. 463-474). Springer.
|
Buchin, K.A., Kreveld, M.J. van, Meijer, H., Speckmann, B. & Verbeek, K. (2010). On planar supports for hypergraphs. In Graph Drawing, 17th International Symposium, GD 2009 (pp. 345-356). Springer.
|
Kreveld, M.J. van, Loeffler, M. & Silveira, R.I. (2010). Optimization for first order Delaunay triangulations. Comput. Geom., 43(4), 377-394.
|
Kreveld, M.J. van, Loeffler, M. & Mitchell, J.S.B. (2010). Preprocessing Imprecise Points and Splitting Triangulations. SIAM Journal on Computing, 39, 2990-3000.
|
Kreveld, M.J. van (2010). Bold Graph Drawings. In Proceedings 21st Canadian Conference on Computational Geometry (CCCG) (pp. 119-122).
|
Aronov, B., Buchin, K.A., Buchin- Walther, M., Kreveld, M.J. van, Löffler, M., Luo, J., Silveira, R.I. & Speckmann, B. (2009). Connect the Dot: Computing Feed-Links with Minimum Dilation. In Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings (pp. 49-60). Springer.
|
Eppstein, D., Kreveld, M.J. van, Mumford, E. & Speckmann, B. (2009). Edges and switches, tunnels and bridges. Comput. Geom., 42, 790-802.
|
Kreveld, M.J. van & Silveira, R.I. (2009). Embedding rivers in polyhedral terrains. In Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009 (pp. 169-178). ACM.
|
Kreveld, M.J. van, Buchin, K.A. & Buchin- Walther, M. (2009). Finding long and similar parts of trajectories. In 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, November 4-6, 2009, Seattle, Washington, USA, Proceedings (pp. 296-305). ACM.
|
Lankveld, T. van, Kreveld, M.J. van & Veltkamp, R.C. (2009). Identifying well-covered minimal bounding rectangles in 2D point data. In EuroCG'09 25th European Workshop on Computational Geometry (pp. 277-280).
|
Di Giacomo, E., Didimo, W., Kreveld, M.J. van, Liotta, G. & Speckmann, B. (2009). Matched Drawings of Planar Graphs. , 13(3), 423-445.
|
Buchin, K.A., Kreveld, M.J. van, Meijer, H., Speckmann, B. & Verbeek, K. (2009). On Planar Supports for Hypergraphs. onbekend: UU BETA ICS Departement Informatica.
|
Silveira, R.I. & Kreveld, M.J. van (2009). Optimal higher order Delaunay triangulations of polygons. Comput. Geom., 42, 803-813.
|
Aronov, B., Kreveld, M.J. van, Loeffler, M. & Silveira, R.I. (2009). Peeling Meshed Potatoes. onbekend: UU BETA ICS Departement Informatica.
|
Hagen, S. ten & Kreveld, M.J. van (2009). Placing Text Boxes on Graphs. In (pp. 284-295). Springer.
|
Borgelt, M.G., Kreveld, M.J. van, Loeffler, M., Luo, J., Merrick, D., Silveira, R.I. & Vahedi, M. (2009). Planar bichromatic minimum spanning trees. Journal of Discrete Algorithms, 7, 469-478.
|
Kreveld, M.J. van, Löffler, M. & Mitchell, J. (2009). Preprocessing Imprecise Points and Splitting Triangulations. onbekend: UU BETA ICS Departement Informatica.
|
Gudmundsson, J., Kreveld, M.J. van & Narasimhan, G. (2009). Region-restricted clustering for geographic data mining. Comput. Geom., 42(3), 231-240.
|
Kaufmann, M., Kreveld, M.J. van & Speckmann, B. (2009). Subdivision Drawings of Hypergraphs. In Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (pp. 396-407). Springer.
|
Silveira, R.I. & Kreveld, M.J. van (2009). Towards a definition of higher order constrained Delaunay triangulations. Comput. Geom., 42(4), 322-337.
|
Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2009). Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst., 44(2), 160-174.
|
Cabello, S., Haverkort, H., Kreveld, M.J. van & Speckmann, B. (2008). Algorithmic Aspects of Proportional Symbol Maps. UU-CS 2008-008. onbekend: UU WINFI Informatica en Informatiekunde.
|
Löffler, M. & Kreveld, M.J. van (2008). Approximating Largest Convex Hulls for Imprecise Points. In Proc. Workshop Approx.\ \& Online Alg.\ 2007 (pp. 89-102).
|
Kreveld, M.J. van & Löffler, M. (2008). Approximating largest convex hulls for imprecise points. Journal of Discrete Algorithms, 6(4), 583-594.
|
Buchin, K.A., Buchin- Walther, M., Kreveld, M.J. van, Löffler, M., Luo, J. & Silveira, R.I. (2008). Clusters in aggregated health data. In Headway in Spatial Data Handling, 13th Int. Symp. on Spatial Data Handling (pp. 77-90). Berlin: Springer.
|
Berg, M.T. de, Cheong, O., Kreveld, M.J. van & Overmars, M.H. (2008). Computational Geometry -- Algorithms and Aplications (3rd). Berlin: Springer-Verlag.
|
Reinbacher, I., Benkert, M., Kreveld, M.J. van, Mitchell, J.S.B., Snoeyink, J. & Wolff, A. (2008). Delineating boundaries for imprecise regions. Algorithmica, 50, 386-414.
|
Kreveld, M.J. van, Mitchell, J.S.B., Rousseeuw, P., Sharir, M., Snoeyink, J. & Speckmann, B. (2008). Efficient algorithms for maximum regression depth. Discr.\ Comput.\ Geom., 656-677.
|
Aronov, B., Buchin, K.A., Buchin- Walther, M., Jansen, B., Jong, T de, Kreveld, M.J. van, Löffler, M., Luo, J., Silveira, R.I. & Speckmann, B. (2008). Feed-links for Network Extensions. In Proc. 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS 2008) (pp. 308-316).
|
Di Giacomo, E., Didimo, W., Kreveld, M.J. van, Liotta, G. & Speckmann, B. (2008). Matched drawings of planar graphs. In Proc. Graph Drawing 2007 (pp. 183-194).
|
Moet, E.J., Kreveld, M.J. van & Stappen, A.F. van der (2008). On realistic terrains. Comput.\ Geom.\ Theory \& Appl., 41, 48-67.
|
Kreveld, M.J. van & Speckmann, B. (2008). Placing Diagrams and Symbols on Maps. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, 14-24.
|
Kreveld, M.J. van, Löffler, M. & Mitchell, J.S.B. (2008). Preprocessing Imprecise Points and Splitting Triangulations. In Algorithms and Computation, 19th International Symposium (ISAAC) (pp. 544-555). Springer.
|
Laube, P., Berg, M. & Kreveld, M.J. van (2008). Spatial support and spatial confidence for spatial association rules. In Headway in Spatial Data Handling, 13th Int. Symp. on Spatial Data Handling (pp. 575-594). Berlin: Springer.
|
Silveira, R.I. & Kreveld, M.J. van (2008). Towards a Definition of Higher Order Constrained Delaunay Triangulations. UU-CS 2008-007. onbekend: UU WINFI Informatica en Informatiekunde.
|
Moet, E.J., Knauer, C. & Kreveld, M.J. van (2008). Visibility Maps of Segments and Triangles in {3D}. Comput.\ Geom.\ Theory \& Appl., 39, 163-177.
|
Kreveld, M.J. van (2007). 3D Geo-Visualization, working group V position paper. In P. van Oosterom, S. Zlatanova, F. Penninga & E. Fendel (Eds.), Advances in 3D Geoinformation Systems (pp. 439-441). Springer.
|
Kreveld, M.J. van & Löffler, M. (2007). Approximating Largest Convex Hulls for Imprecise Points. UU-CS 2007-038. onbekend: UU WINFI Informatica en Informatiekunde.
|
Eppstein, D., Kreveld, M.J. van, Mumford, E. & Speckmann, B. (2007). Edges and Switches, Tunnels and Bridges. In Proc. 10th WADS (pp. 77-88). Berlin: Springer.
|
Eppstein, D., Kreveld, M.J. van, Mumford, E. & Speckmann, B. (2007). Edges and Switches, Tunnels and Bridges. UU-CS 2007-042. onbekend: UU WINFI Informatica en Informatiekunde.
|
Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2007). Efficient detection of patterns in 2D trajectories of moving points. GeoInformatica, 11, 195-215.
|
Kok, T. de, Kreveld, M.J. van & Löffler, M. (2007). Generating realistic terrains with higher-order Delaunay triangulations. Comput. Geom. Theory & Appl., 36, 52-65.
|
Borgelt, M.G., Kreveld, M.J. van & Luo, J. (2007). Geodesic Disks and Clustering in a Simple Polygon. In ISAAC (pp. 656-667). Springer.
|
Borgelt, M.G., Kreveld, M.J. van & Luo, J. (2007). Geodesic Disks and Clustering in a Simple Polygon. UU-CS 2007-043. onbekend: UU WINFI Informatica en Informatiekunde.
|
Löffler, M. & Kreveld, M.J. van (2007). Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points. UU-CS 2007-025. onbekend: UU WINFI Informatica en Informatiekunde.
|
Löffler, M. & Kreveld, M.J. van (2007). Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points. In Proc. 10th WADS (pp. 446-457). Berlin: Springer.
|
Aronov, B., Kreveld, M.J. van, Löffler, M. & Silveira, R.I. (2007). Largest Subsets of Triangles in a Triangulation. In Proc. 19th CCCG (pp. 213-216).
|
Giacomo, E. Di, Didimo, W., Kreveld, M.J. van, Liotta, G. & Speckmann, B. (2007). Matched Drawings of Planar Graphs. UU-CS 2007-054. onbekend: UU WINFI Informatica en Informatiekunde.
|
Kreveld, M.J. van & Speckmann, B. (2007). On rectangular cartograms. Comput. Geom. Theory & Appl., 37, 175-187.
|
Kreveld, M.J. van & Speckmann, B. (2007). On the Number of Empty Pseudo-Triangles in Point Sets. In Proc 19th CCCG (pp. 37-40).
|
Kreveld, M.J. van & Speckmann, B. (2007). On the Number of Empty Pseudo-Triangles in Point Sets. UU-CS 2007-045. onbekend: UU WINFI Informatica en Informatiekunde.
|
Silveira, R.I. & Kreveld, M.J. van (2007). Optimal Higher Order Delaunay Triangulations of Polygons. UU-CS 2007-034. onbekend: UU WINFI Informatica en Informatiekunde.
|
Silveira, R.I. & Kreveld, M.J. van (2007). Optimal higher order Delaunay triangulations of polygons. In Abstracts of the 23th Europ. Workshop on Comput. Geom. (pp. 194-197).
|
Kreveld, M.J. van, Löffler, M. & Silveira, R.I. (2007). Optimization for First Order Delaunay Triangulations. In Proc. 10th WADS (pp. 175-187). Berlin: Springer.
|
Kreveld, M.J. van, Löffler, M. & Silviera, S.A. da (2007). Optimization for First Order Delaunay Triangulations. UU-CS 2007-011. onbekend: UU WINFI Informatica en Informatiekunde.
|
Borgelt, M.G., Kreveld, M.J. van, Löffler, M., Luo, J., Merrick, D., Silveira, R.I. & Vahedi, M. (2007). Planar Bichromatic Minimum Spanning Trees. UU-CS 2007-044. onbekend: UU WINFI Informatica en Informatiekunde.
|
Borgelt, M.G., Kreveld, M.J. van, Löffler, M., Luo, J., Merrick, D., Silveira, R.I. & Vahedi, M. (2007). Planar bichromatic minimum spanning trees. In Abstracts of the 23th Europ. Workshop on Comput. Geom. (pp. 162-165).
|
Moet, E.J., Kreveld, M.J. van & Oostrum, R.W. van (2007). Region intervisibility in terrains. In Vol. 17. International Journal of Computational Geometry and Applications (pp. 331-347).
|
Gudmundsson, J., Kreveld, M.J. van & Merrick, D. (2007). Schematisation of tree drawings. In Proc. 14th Graph Drawing 2006, revised papers (pp. 66-76). Berlin: Springer.
|
Silveira, R.I. & Kreveld, M.J. van (2007). Towards a Definition of Higher Order Constrained Delaunay Triangulations. In Proc. 19th CCCG (pp. 161-164).
|
Kreveld, M.J. van & Luo, J. (2007). Trajectory and Subtrajectory similarity. In Proc. 15th ACM Symposium on the Advances in GIS.
|
Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2007). Wooden Geometric Puzzles: Design and Hardness Proofs. In P. Crescenzi, G. Prencipe & G. Pucci (Eds.), Proceedings 4th International Conference on Fun with Algorithms, FUN 2007 (pp. 16-29). Springer, Lecture Notes in Computer Science, volume 4475.
|
Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2007). Wooden Geometric Puzzles: Design and Hardness Proofs. CS-UU 2007-009. onbekend: UU WINFI Informatica en Informatiekunde.
|
Speckmann, B., Kreveld, M.J. van & Florisson, S. (2006). A Linear Programming Approach to Rectangular Cartograms. In A. Riedl, W. Kainz & G. Elmes (Eds.), Progress in Spatial Data Handling, 12th Int. Sympos. on Spatial Data Handling (pp. 529-546). Berlin: Springer.
|
Cabello, S., Haverkort, H., Kreveld, M.J. van & Speckmann, B. (2006). Algorithmic Aspects of Proportional Symbol Maps. In Proc. 14th Europ. Symp. on Algorithms (pp. 720-731). Berlin: Springer.
|
Kreveld, M.J. van & Stappen, A.F. van der (2006). Approximate unions of lines and Minkowski sums. Algorithmica, 45, 91-107.
|
Bose, J., Cabello, S., Cheong, O., Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2006). Area-preserving approximations of polygonal paths. J. of Discrete Algorithms, 4, 554-566.
|
Kreveld, M.J. van (2006). Computational Geometry: Its objectives and relation to GIS. In P.J.M. van Oosterom & M.J. van Kreveld (Eds.), Geo-information and Computational Geometry (pp. 1-8). Delft: NCG.
|
Gudmundsson, J. & Kreveld, M.J. van (2006). Computing longest duration flocks in trajectory data. In Proc. 14th ACM Symp. on the Advances in GIS (pp. 35-42).
|
Oosterom, P.J.M. van & Kreveld, M.J. van (Eds.). (2006). Geo-information and Computational Geometry. Delft: NCG.
|
Löffler, M. & Kreveld, M.J. van (2006). Largest and Smallest Tours and Convex Hulls for Imprecise Points. In Proc. 10th Scandinavian Workshop on Algorithm Theory (pp. 375-387). Berlin: Springer.
|
Löffler, M. & Kreveld, M.J. van (2006). Largest and Smallest Tours and Convex Hulls for Imprecise Points. onbekend: UU WINFI Informatica en Informatiekunde.
|
Moet, E.J., Kreveld, M.J. van & Stappen, A.F. van der (2006). On Realistic Terrains. UU-CS 2006-029. onbekend: UU WINFI Informatica.
|
Moet, E.J., Kreveld, M.J. van & Stappen, A.F. van der (2006). On Realistic Terrains. In I. Emiris, M. Karevalas & L. Palios (Eds.), Abstracts of the 22nd European Workshop on Computational Geometry (EWCG'06) (pp. 169-172).
|
Moet, E.J., Kreveld, M.J. van & Stappen, A.F. van der (2006). On Realistic Terrains. In N. Amenta & O. Cheong (Eds.), Proceedings of the 22nd ACM Symposium on Computational Geometry (pp. 177-186). Sedona, Arizona, USA.
|
Gudmundsson, J., Kreveld, M.J. van & Narasimhan, G. (2006). Region-restricted clustering for geographic data mining. In Proc. 14th Europ. Symp. on Algorithms (pp. 399-410). Berlin: Springer.
|
Gudmundsson, J., Kreveld, M.J. van & Narasimhan, G. (2006). Region-restricted clustering for geographic data mining. onbekend: UU WINFI Informatica en Informatiekunde.
|
Reinbacher, I., Kreveld, M.J. van & Benkert, M. (2006). Scale dependent definitions of gradient and aspect and their computation. In A. Riedl, W. Kainz & G. Elmes (Eds.), Progress in Spatial Data Handling, 12th Int. Sympos. on Spatial Data Handling (pp. 863-879). Berlin: Springer.
|
Reinbacher, I., Kreveld, M.J. van, Adelaar, T. & Benkert, M. (2006). Scale dependent definitions of gradient and aspect and their computation. onbekend: UU WINFI Informatica en Informatiekunde.
|
Moet, E.J., Knauer, C. & Kreveld, M.J. van (2006). Visibility Maps of Segments and Triangles in 3D. In M. Gavrilova et al. (Ed.), Proc. ICCSA'2006, 6th International Workshop on Computational Geometry and Applications (CGA'06) Vol. 3980. Lecture Notes in Computer Science (pp. 20-29). Berlin Heidelberg: Springer-Verlag.
|
Arampatzis, A., Kreveld, M.J. van, Reinbacher, I., Jones, C.B., Vaid, S., Clough, P., Joho, H. & Sanderson, M. (2006). Web-based delineation of imprecise regions. Computers, environment and urban systems, 30, 426-459.
|
Kreveld, M.J. van & Schlechter, T. (2005). Automated label placement for groups of islands. In Proc. 22th Int. Cart. Conf..
|
Gudmundsson, J., Haverkort, H.J. & Kreveld, M.J. van (2005). Constrained higher order Delaunay triangulations. Comput. Geom. Theory & Appl., 30, 271-277.
|
Reinbacher, I., Benkert, M., Kreveld, M.J. van, Mitchell, J., Snoeyink, J. & Wolff, A. (2005). Delineating Boundaries for Imprecise Regions. UU-CS 2005-026. onbekend: UU WINFI Informatica en Informatiekunde.
|
Reinbacher, I., Benkert, M., Kreveld, M.J. van, Mitchell, J.S.B. & Wolff, A. (2005). Delineating boundaries for imprecise regions. In Proc. 13th Europ. Symp. on Algorithms (pp. 143-154). Berlin: Springer.
|
Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2005). Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets. onbekend: UU WINFI Informatica en Informatiekunde.
|
Bose, P. & Kreveld, M.J. van (2005). Generalizing Monotonicity: On Recognizing Special Classes of Polygons and Polyhedra. UU-CS 2005-042. onbekend: UU WINFI Informatica en Informatiekunde.
|
Bose, P. & Kreveld, M.J. van (2005). Generalizing monotonicity: on recognizing special classes of polygons and polyhedra. Int. J. Comp. Geom. & Appl., 15, 591-608.
|
Kok, de T., Kreveld, M.J. van & Löffler, M. (2005). Generating Realistic Terrains with Higher-Order Delauney Triangulations. UU-CS 2005-020. onbekend: UU WINFI Informatica en Informatiekunde.
|
Kok, T. de, Kreveld, M.J. van & Löffler, M. (2005). Generating realistic terrains with higher-order Delaunay triangulations. In Proc. 13th Europ. Symp. on Algorithms (pp. 343-354). Berlin: Springer.
|
Kok, T. de, Kreveld, M.J. van & Löffler, M. (2005). Minimizing local minima in terrains with higher-order Delaunay triangulations. In Abstracts of the 21th Europ. Workshop on Comput. Geom. (pp. 115-118).
|
Kreveld, M.J. van, Reinbacher, I., Arampatzis, A. & Zwol, R. van (2005). Multi-dimensional scattered ranking methods for geographic information retrieval. GeoInformatica, 9, 61-84.
|
Kreveld, M.J. van & Speckmann, B. (2005). Rectangular cartogram computation with sea regions. In Proc. 22st Int. Cartographic Conference.
|
Florisson, S., Kreveld, M.J. van & Speckmann, B. (2005). Rectangular cartograms: construction and animation. In Proc. 21st Annu. ACM Sympos. Comput. Geom. (pp. 372-373).
|
Moet, E.J., Kreveld, M.J. van & Oostrum, R.W. van (2005). Region Intervisibility in Terrains. UU-CS 2005-028. onbekend: UU WINFI Informatica en Informatiekunde.
|
Cabello, S., Berg, M.T. de & Kreveld, M.J. van (2005). Schematization of networks. Comput. Geom. Theory & Appl., 30, 223-238.
|
Moet, E.J., Knauer, C. & Kreveld, M.J. van (2005). Visibility Maps of Segments and Triangles in 3D. UU-CS 2005-049. onbekend: UU WINFI Informatica en Informatiekunde.
|
Arampatzis, A., Kreveld, M.J. van, Reinbacher, I., Jones, C.B., Vaid, S., Clough, P., Joho, H. & Sanderson, M. (2005). Web-based Delineation of Imprecise Regions. UU-CS 2005-036. onbekend: UU WINFI Informatica en Informatiekunde.
|
Kreveld, M.J. van, Schramm, E. & Wolff, A. (2004). Algorithms for the placement of square and pie charts on maps. In GIS 2004: Proc. of the 12th ACM Sympos. on Advances in GIS (pp. 222-231).
|
Kreveld, M.J. van & Stappen, A.F. van der (2004). Approximate Unions of Lines and Minkowski Sums. UU-CS 2004-61. Utrecht: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van & Stappen, A.F. van der (2004). Approximate unions of lines and Minkowski sums. In Algorithms - ESA 2004, Proc. 12th Europ. Sympos. Alg. (pp. 448-459). Berlin: Springer.
|
Bose, P., Cabello Justo, S., Cheong, O., Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2004). Area-Preserving Approximations of Polygonal Paths. UU-CS 2004-043. Utrecht: Utrecht University: Information and Computing Sciences.
|
Bose, P. & Kreveld, M.J. van (2004). Computing nice sweeps for polyhedra and polygons. In Proceedings of the Canadian Conference on Computational Geometry (CCCG) (pp. 108-111).
|
Gudmundsson, J., Haverkort, H.J. & Kreveld, M.J. van (2004). Constrained Higher Order Delaunay Triangulations. UU-CS 2004-007. Utrecht: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van, Oostrum, R.W. van, Bajaj, C., Pascucci, V. & Schikore, D. (2004). Contour Trees and Small Seed Sets for Isosurface Generation. In Sanjay Rana (Ed.), Topological Data Structures for Surfaces (pp. 71-85). Wiley.
|
Kreveld, M.J. van (2004). De Zoektocht naar een Kubuspuzzel. Pythagoras, 10-13.
|
Kreveld, M.J. van, Reinbacher, I., Arampatzis, A. & Zwol, R. van (2004). Distributed Ranking Methods for Geographic Information Retrieval. UU-CS 2004-027. Utrecht: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van, Reinbacher, I., Arampatzis, A. & Zwol, R. van (2004). Distributed Ranking Methods for Geographic Information Retrieval. In Abtracts of the 20th European Workshop on Computational Geometry 2004. (pp. 225-228).
|
Kreveld, M.J. van, Reinbacher, I., Arampatzis, A. & Zwol, R. van (2004). Distributed ranking methods for geographic information retrieval. In P.F. Fisher (Ed.), Developments in Spatial Data Handling: 11th Int. Sympos. on Spatial Data Handling (pp. 231-243).
|
Gudmundsson, J., Kreveld, M.J. van & Speckmann, B. (2004). Efficient detection of motion patterns in spatio-temporal data sets. In GIS 2004: Proc. of the 12th ACM Sympos. on Advances in GIS (pp. 250-257).
|
Laube, P., Kreveld, M.J. van & Imfeld, S. (2004). Finding REMO -- detecting relative motion patterns in geospatial lifelines. In P.F. Fisher (Ed.), Developments in Spatial Data Handling: 11th Int. Sympos. on Spatial Data Handling (pp. 201-215).
|
Kreveld, M.J. van (2004). Geographic Information Systems. In J.E..Goodm en J. O'Rourke (Ed.), Handbook of Discrete and Computational Geometry (pp. 1293-1314). Boca Raton: Chapman & Hall/CRC.
|
Kreveld, M.J. van & Reinbacher, I. (2004). Good NEWS: Partitioning a simple polygon by compass directions. International journal of computational geometry & applications, 14, 233-259.
|
Kreveld, M.J. van & Speckman, B. (2004). On Rectangular Cartograms. UU-CS 2004-040. Utrecht: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van & Speckmann, B. (2004). On rectangular cartograms. In Algorithms - ESA 2004, Proc. 12th Europ. Sympos. Alg. (pp. 724-735). Berlin: Springer.
|
Kreveld, M.J. van, Moet, E.J. & Oostrum, R. van (2004). Region inter-visibility on terrains. In Abstracts of the 20th Europ. Workshop on Comput. Geom. (pp. 155-158). Universidad de Sevilla.
|
Arampatzis, A., Kreveld, M.J. van, Reinbacher, I., Jones, C.B., Vaid, S., Clough, P., Joho, H., Sanderson, M., Benkert, M. & Wolff, A. (2004). Web-based delineation of imprecise regions (abstract). In Workshop on Geographical Information Retrieval (with SIGIR).
|
Cabello, S. & Kreveld, M.J. van (2004). Approximation Algorithms for Aligning Points. In Proc. 19th ACM Symp. on Computational Geometry Algorithmica (pp. 20-28).
|
Cabello, S. & Kreveld, M.J. van (2003). Approximation Algorithms for Aligning Points. Algorithmica, 37, 211-232.
|
Cabello Justo, S. & Kreveld, M.J. van (2003). Approximation algorithms for aligning points. UU-CS 2003-003. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Zwol, R. van, Kreveld, M.J. van, Reinbacher, I. & Veltkamp, R.C. (2003). Aspects of Spatial Similarity Measures. Utrecht, the Netherlands: Institute of Information and Computing Sciences, Utrecht Uni.
|
Kreveld, M.J. van (2003). Boekbesprekingen [Book review Computational Geometry on Surfaces]. Nieuw archief voor wiskunde, 5/4(3), 261-261.
|
Kreveld, M.J. van (2003). Composable art: objects that can be arranged in many ways. In Javier Barrallo, Nathaniel Friedman, Reza Sarhangi, Carlo Sequin, Jose Martinez & Juan.A. Maldonado (Eds.), Meeting Alhambra, ISAMA - Bridges 2003 Conference Proceedings (pp. 101-108).
|
Gudmundsson, J. G., Haverkort, H.J. & Kreveld, M.J. van (2003). Constraint Higher-Order Delaunay Triangulations. In 19th European Workshop on Computational Geometry CG 2003. Bonn: Institute of Computer Science I, University of Bonn.
|
Aronov, B., Kreveld, M.J. van, Oostrum, R.W. van & Varadarajan, K. (2003). Facility location on terrains. Discrete and Computational Geometry, 30, 357-372.
|
Kreveld, M.J. van & Reinbacher, I. (2003). Good NEWS: Partitioning a Simple Polygon by Compass Direction. UU-CS 2003-020. Utrecht: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van & Reinbacher, I. (2003). Good NEWS: Partitioning a simple polygon by compass directions. In Proc. 19th Annu. ACM Sympos. Comput. Geom. (pp. 78-87).
|
Kreveld, M.J. van (2003). On the Education of GIS Algorithm Design. Utrecht: Institute of Information and Computing Sciences, UU.
|
Bose, P., Kreveld, M.J. van, Maheshwari, A., Morin, P. & Morrison, J. (2003). Translating a regular grid over a point set. Computational Geometry: Theory and Applications, 25, 21-34.
|
Kreveld, M.J. van & Speckmann, B. (2002). Cutting a country for smallest square fit. In P. Bose & P. Morin (Eds.), Proceedings ISAAC'02 (pp. 91-102). Berlin, Germany: Spinger-Verlag.
|
Kreveld, M.J. van, Mitchell, D.L., Rousseeuw, P., Sharir, M., Snoeyink, J. & Speckman, B. (2002). Efficient algorithms for maximum regression depth. UU-CS 2002-039. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Gudmundsson, J. G., Hammar, M. & Kreveld, M.J. van (2002). Higher order Delaunay triangulations. Computational Geometry: Theory and Applications, 23(1), 85-98.
|
Strijk, T.W. & Kreveld, M.J. van (2002). Practical extensions of point labeling in the slider model. GeoInformatica, 6(2), 181-197.
|
Cabello Justo, S. & Kreveld, M.J. van (2002). Schematic Networks: an Algorithm and it's Implementation. In D.E. Richardson & P. van Oosterom (Eds.), 10 International Symposium on Spatial Data Handling (SDH) (pp. 475-486). Ottawa, USA.
|
Justo, S. Cabello, Berg, M.T. de & Kreveld, M.J. van (2002). Schematization of Networks. UU-CS 2002-040. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Jones, C.B., Purves, R., Ruas, A., Sanderson, M., Sester, M., Kreveld, M.J. van & Weibel, R. (2002). Spatial Information Retrieval and Geographical Ontologies. An Overview of the SPIRIT Project. UU-CS 2002-043. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Jones, C.B., Purves, R., Ruas, A., Sanderson, M., Sester, M., Kreveld, M.J. van & Weibel, R. (2002). Spatial information retrieval and geographical ontologies -- an overview of the SPIRIT project. In Proceedings 25th Annual Conference on Research and Development in Information Retrieval (SIGER 2002) (pp. 387-388). ACM Press.
|
Dijk, S.F. van, Kreveld, M.J. van, Strijk, T. & Wolff, A. (2002). Towards an evaluation of quality for names placement methods. International Journal of Geographical Information Science, 16(7), 641-661.
|
Wolff, A., Knipping, L., Kreveld, M.J. van, Strijk, T.W. & Agarwal, P.K. (2001). A simple and efficient algorithm for high-quality line labeling. UU-CS 2001-44. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aronov, B., Kreveld, M.J. van, Oostrum, R.W. van & Varadarajan, K. (2001). Facility location on terrains. UU-CS 2001-56. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van (2001). Guest Editor's Foreword, Special Issue on Algorithms. Algorithmica, 30, 141-143.
|
Hammar, M., Gudmundsson, J. G. & Kreveld, M.J. van (2001). Higher Order Delaunay Triangulations. UU-CS 2001-05. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Cabello Justo, S., Berg, M.T. de, Dijk, S.F. van, Kreveld, M.J. van & Strijk, T.W. (2001). Schematization of Road Networks. In Proc. 17th ACM Symp. on Computational Geometry (pp. 33-39). New York, U.S.A.: ACM Press.
|
Kreveld, M.J. van (2001). Smooth Generalization for Continuous Zooming. In Proceedings 20th International Cartographic Conference (pp. 2180-2185). Beijing, China: Chinese Society of Geodesy, Photogrammetry and Cartography.
|
Dijk, S.F. van, Kreveld, M.J. van, Strijk, T.W. & Wolff, A. (2001). Towards an evaluation of quality for names placement methods. UU-CS 2001-43. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Bose, P., Kreveld, M.J. van, Maheshwari, A., Morin, P.J. & Morisson, J. (2001). Translating a Regular Grid over a Point Set. UU-CS 2001-20. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Wolff, A., Knipping, L., Kreveld, M.J. van, Strijk, T.W. & Agardwal, P.K. (2000). A simple and efficient algorithm for high-quality line labeling. In Innovations in GIS VII: Geo Computation (pp. 147-159). Taylor & Francis.
|
Berg, M.T. de, Kreveld, M.J. van, Overmars, M.H. & Schwarzkopf, O. (2000). Computational Geometry: Algorithms and Applications (second edition). Heidelberg: Springer-Verlag.
|
Strijk, T.W. & Kreveld, M.J. van (2000). Practical extensions of point labeling in the slider model. UU-CS 2000-08. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Wolff, A., Knipping, L., Kreveld, M.J. van, Strijk, T.W. & Agarwal, K. (1999). A Simple and Efficient Algorithm for High Quality Line Labeling. In Proceedings GIS Research UK, 7th Annual Conference (GISRUK'99) (pp. 146-150). Southampton: Department of Geography, University of Southampton.
|
Kreveld, M.J. van, Mitchell, J.B.L., Rousseeuw, P., Sharir, M., Snoeyink, J. & Speckmann, B. (1999). Efficient algorithms for maximum regression depth. In Proceedings of the 15th Annual ACM Symposium on Computational Geometry (pp. 31-40). New York: ACM Press.
|
Kreveld, M.J. van & Veldhorst, M. (1999). Overdragen van de Informatica. Tijdschrift voor Informatica-onderwijs, 8, 59-61.
|
Kreveld, M.J. van, Strijk, T.W. & Wolff, A. (1999). Point Labeling with Sliding Labels. Computational Geometry: Theory and Applications, 13, 21-47.
|
Strijk, T.W. & Kreveld, M.J. van (1999). Practical extensions of point labeling in the slider model. In Proceedings 7th ACM Workshop on the Advances of GIS (pp. 47-52).
|
Dijk, S.F. van, Kreveld, M.J. van, Strijk, T.W. & Wolff, A. (1999). Towards an Evaluation of Quality for Label Placement Methods. In C.P. Keller (Ed.), Proceedings of the 19th International Cartographic Conference (pp. 905-913). Ottawa, Canada: University of Victoria, Department of Geography.
|
Berg, M.T. de, Cheong, O., Devillers, O., Kreveld, M.J. van & Teillaud, M. (1998). Computing the maximum overlap of two convex polygons under translations. Theory of computing systems, 31, 613-628.
|
Bajaj, C., Kreveld, M.J. van & Oostrum, R.W. van (1998). Contour trees and small seed sets for isosurface traversal. UU-CS 1998-25. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Jansen, M. & Kreveld, M.J. van (1998). Evaluating the consistency of cartographic generalization. In T.K. Poiker & N. Chrisman (Eds.), Proceedings 8th International Symposium on Spatial Data Handling (pp. 668-678). Burnaby, Canada: GIS LAB, Simon Fraser University.
|
Aronov, B., Kreveld, M.J. van, Oostrum, R.W. van & Varadarajan, K. (1998). Facility location on terrains. In K.Y. Chwa & O.H. Ibarra (Eds.), Algorithms and Computation (ISAAC'98 Proceedings) (pp. 19-28). Berlin, Germany: Springer Verlag.
|
Bose, P., Kreveld, M.J. van & Toussaint, G. (1998). Filling polyhedral molds. Computer Aided Design, 30, 245-254.
|
Kreveld, M.J. van (1998). Finding the wood by the trees. UU-CS 1998-28. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van (1998). Finding the wood by the trees. CG Tribune, 10, 4-5.
|
Agarwal, P.K., Kreveld, M.J. van & Suri, S. (1998). Label placement by maximum independent set in rectangles. Computational Geometry: Theory and Applications, 11, 209-218.
|
Agarwal, P.K. & Kreveld, M.J. van (1998). Label placement by maximum independent set in rectangles. UU-CS 1998-04. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Strijk, T.W. & Kreveld, M.J. van (1998). Labeling a rectilinear map more efficiently. UU-CS 1998-29. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van (1998). On fat partitioning, fat covering and the union size of polygons. Computational Geometry: Theory and Applications, 9, 197-210.
|
Kreveld, M.J. van & Peschier, J. (1998). On the automated generalization of road network maps. In Proceedings of the 3rd International Conference on GeoComputation.
|
Kreveld, M.J. van & Strijk, T.W. (1998). Point labeling with sliding labels. UU-CS 1998-40. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van, Strijk, T.W. & Wolff, A. (1998). Point set labeling with sliding labels. In Proceedings 14th Annual ACM Symposium on Computational Geometry (pp. 337-346).
|
Berg, M.T. de, Kreveld, M.J. van & Schirra, S. (1998). Topologically correct subdivision simplification using the bandwidth criterion. Cartography and GIS, 25, 243-257.
|
Kreveld, M.J. van, Nievergelt, J., Roos, T. & Widmayer, P. (1997). Algorithmic Foundations of Geographic Information Systems. Berlin, Germany: Springer verlag.
|
Kreveld, M.J. van (1997). Algorithms for triangulated terrains. In F. Plavsil & K.G. Jeffery (Eds.), Sofsem'97, Theory and Practice of Informatics (pp. 19-36). Berlin, Germany: Springer Verlag.
|
Kreveld, M.J. van (1997). Algorithms for triangulated terrains. UU-CS 1997-32. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Kreveld, M.J. van & Overmars, M.H. (1997). Computational Geometry: Algorithms and Applications. Heidelberg, Germany: Springer Verlag.
|
Kreveld, M.J. van, Oostrum, R.W. van, Bajaj, C., Pascucci, V. & Schikore, D. (1997). Contour trees and small seed sets for isosurface traversal. In Proceedings 13th Annual ACM Symposium on Computational Geometry (pp. 212-220). New York, U.S.A.: ACM Press.
|
Bose, P., Bremner, D. & Kreveld, M.J. van (1997). Determining the castability of simple polyhedra. Algorithmica, 19, 84-113.
|
Kreveld, M.J. van (1997). Digital elevation models and {TIN} algorithms. In M.J. Kreveld, J. Nievergelt, T. Roos & P. Widmayer (Eds.), Algorithmic Foundations of Geographic Information Systems (pp. 37-78). Berlin, Germany: Springer Verlag.
|
Yu, S., Kreveld, M.J. van & Snoeyink, J. (1997). Drainage queries in TINs: from local to global and back again. In M.J. Kraak & M. Molenaar (Eds.), Advances in GIS Research II (pp. 829-842). London, England: Taylor & Francis.
|
Kreveld, M.J. van, Oostrum, R.W. van & Snoeyink, J. (1997). Efficient settlement selection for interactive display. In Proceedings Auto-Carto 13: ACSM/ASPRS Annual Convention Technical Papers (pp. 287-296). Bethesda, MD, U.S.A.: ASPRS.
|
Snoeyink, J. & Kreveld, M.J. van (1997). Good orders for incremental (re)construction. In Proceedings 13th Annual ACM Symposium on Computational Geometry (pp. 400-402). New York, U.S.A.: ACM Press.
|
Agarwal, P.K., Kreveld, M.J. van & Suri, S. (1997). Label placement by maximum independent set in rectangles. In Proceedings 9th Canadian Conference on Computational Geometry (pp. 233-238). Ontario, Canada: Kingston.
|
Snoeyink, J. & Kreveld, M.J. van (1997). Linear-time reconstruction of Delaunay triangulations with applications. In R. Burkard & G. Woeginger (Eds.), Algorithms - ESA '97 (pp. 459-471). Springer Verlag, Berlin, Germany: 1997.
|
Berg, M.T. de, Kreveld, M.J. van, Oostrum, R.W. van & Overmars, M.H. (1997). Simple traversal of a subdivision without extra storage. International Journal of Geographical Information Science, 11, 359-373.
|
Berg, M.T. de, Halperin, D., Overmars, M.H. & Kreveld, M.J. van (1997). Sparse arrangements and the numbers of views of polyhedral scenes. International journal of computational geometry & applications, 7, 175-195.
|
Berg, M.T. de & Kreveld, M.J. van (1997). Trekking in the alps without freezing or getting tired. Algorithmica, 18, 306-323.
|
Kreveld, M.J. van (1997). Variations on sweep algorithms: efficient computation of extended viewsheds and classifications. In M.J. Kraak & M. Molenaar (Eds.), Advances in GIS Research II (pp. 843-855). London, England: Taylor & Francis.
|
Everett, H., Robert, J.M. & Kreveld, M.J. van (1996). An optimal algorithm for the (k)-levels, with applications to separation and transversal problems. International journal of computational geometry & applications, 6, 247-261.
|
Berg, M.T. de, Kreveld, M.J. van & Cheong, O. (1996). Computing the Maximum Overlap of Two Convex Polygons Under Translations. UU-CS 1996-33. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Devillers, O., Kreveld, M.J. van, Schwarzkopf, O. & Teillaud, M. (1996). Computing the maximum overlap of two convex polygons under translations. In T. Asano, Y. Igarashi, H. Nagamochi, S. Migano & S. Suri (Eds.), Proceedings 7th Annual International Symposium on Algorithms and Computing (ISAAC'96) (pp. 126-135). Heidelberg: Springer Verlag.
|
Agarwal, P.K. & Kreveld, M.J. van (1996). Connected component and simple polygon intersection searching. Algorithmica, 15, 626-660.
|
Yu, S., Kreveld, M.J. van & Snoeyink, J. (1996). Drainage queries in TINs: from local to global and back again. In M. Kraak & M. Molenaar (Eds.), Proceedings 7th International Symposium on Spatial Data Handling (pp. 13A.1-13A.14). Delft, The Netherlands: Faculty of Geodetic Engineering, Delft U. of Technology.
|
Kreveld, M.J. van (1996). Efficient methods for isoline extraction from a tin. International Journal of GIS 10, 523-540.
|
Kreveld, M.J. van, Snoeyink, J. & Whitesides, S. (1996). Folding rulers inside triangles. Discrete and Computational Geometry, 15, 265-285.
|
Berg, M.T. de, Kreveld, M.J. van, Schwarzkopf, O. & Snoeyink, J. (1996). Point location in zones of k-flats in arrangements. Computational Geometry: Theory and Applications, 6, 131-143.
|
Berg, M.T. de, Kreveld, M.J. van, Oostrum, R.W. van & Overmars, M.H. (1996). Simple traversal of a subdivision without extra storage. UU-CS 1996-17. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Bose, P., Dobrindt, K., Kreveld, M.J. van, Overmars, M.H., Groot, M. de, Roos, T., Snoeyink, J. & Yu, S. (1996). The complexity of rivers in triangulated terrains. In Proceedings of the 8th Canadian Conference on Computational Geometry (pp. 325-330). Ottawa, Canada.
|
Kreveld, M.J. van (1996). Variations on sweep algorithms: efficient computation of extended viewsheds and class intervals. UU-CS 1996-22. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Kreveld, M.J. van (1996). Variations on sweep algorithms: efficient computation of extended viewsheds and classifications. In M. Kraak & M. Molenaar (Eds.), Proceedings 7th International Symposium on Spatial Data Handling (pp. 13A.15-13A.27). Delft: Faculty of Geodetic Engineering, Delft University of Technol.
|
Berg, M.T. de & Kreveld, M.J. van (1995). A new approach to subdivision simplification. UU-CS 1995-26. Utrecht: Utrecht University.
|
Agarwal, P.K. & Kreveld, M.J. van (1994). Connected component and simple polygon intersection searching. UU-CS 1994-10. Utrecht.
|
Bose, P. & Kreveld, M.J. van (1994). Determining the castability of simple polyhedra. UU-CS 1994-26. Utrecht.
|
Kreveld, M.J. van (1994). Efficient methods for isoline extraction from a digital elevation model based on triangulated irregular networks. UU-CS 1994-21. Utrecht.
|
Kreveld, M.J. van (1994). Folding rulers inside triangles. UU-CS 1994-41. Utrecht.
|
Berg, M.T. de & Kreveld, M.J. van (1994). Trekking in the Alps without freezing or getting tired. UU-CS 1994-02. Utrecht.
|
Kreveld, M.J. van (1993). On Fat Partioning, Fat Covering and the Union Size of Polygons. RUU-CS 93-36. Utrecht.
|
Berg, M.T. de & Kreveld, M.J. van (1993). Rectilinear Decompositions with Low Stabbing Number. RUU-CS 93-25. Utrecht.
|
Agarwal, P.K. & Kreveld, M.J. van (1992). Implicit point location in arrangements of line segments, with an application to motion planning. RUU-CS 92-15. Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Kreveld, M.J. van (1992). Sparse arrangements and the number of views of polyhedral scenes. RUU-CS 92-24. Utrecht.
|
Kreveld, M.J. van (1992). The power of parallel projection. RUU-CS 92-17. Utrecht.
|
Agarwal, K., Kreveld, M.J. van & Overmars, M.H. (1991). Intersection queries in curved objects. RUU-CS 91-12. Utrecht.
|
Berg, M.T. de & Kreveld, M.J. van (1991). Point location in zones of k-flats in arrangements. RUU-CS 91-09. Utrecht.
|
Berg, M.T. de, Kreveld, M.J. van & Overmars, M.H. (1991). Shortest path queries in rectilinear words. RUU-CS 91-20. Utrecht.
|
Berg, M.T. de & Kreveld, M.J. van (1991). Two- and three-dimensional point location in Rectangular subdivisions. RUU-CS 91-29. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1991). Union-copy structures and dynamic segment trees. RUU-CS 91-05. Utrecht.
|
Berg, M.T. de, Kreveld, M.J. van & Overmars, M.H. (1990). Finding shortest paths in the presence of orthogonal obstacles using a combined L1 and link metric. RUU-CS 90-20. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1990). Intersection queries in sets of disks. RUU-CS 90-13. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1989). Concatenable structures for decomposable problems. RUU-CS 89-16. Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Kreveld, M.J. van (1989). Finding complete bipartite subgraphs in bipartite graphs. RUU-CS 89-30. Utrecht.
|
Kreveld, M.J. van & Berg, M.T. de (1989). Finding squares and rectangles in sets of points. RUU-CS 89-10. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1988). Concatenable segment trees. RUU-CS 88-36. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1988). Divided k-d trees. RUU-CS 88-28. Utrecht.
|
Overmars, M.H., Berg, M.T. de & Kreveld, M.J. van (1987). Maintaining range trees in secondary memory Part I; Partitions. RUU-CS 87-20. Utrecht.
|
webmaster@cs.uu.nl,
Sun, 12 Feb 2012 17:39:18 +0100
←
Departement Informatica, Universiteit Utrecht