Berg, M.T. de, Cheong, O., Kreveld, M.J. van & Overmars, M.H. (2008). Computational Geometry -- Algorithms and Aplications (3rd). Berlin: Springer-Verlag.
|
Berg, M.T. de, Halperin, D. & Overmars, M.H. (2007). An intersection-sensitive algorithm for snap rounding. Computational Geometry: Theory and Applications, 36, 159-165.
|
Ahn, H.K., Berg, M.T. de, Cheong, O., Haverkort, H.J., Stappen, A.F. van der & Toma, L. (2006). River networks and watershed maps of triangulated terrains revisited. In I. Emiris, I. Emiris, M. Karevalas, M. Karevalas, L. Palios & L. Palios (Eds.), Abstracts of the 22nd European Workshop on Computational Geometry (EWCG'06) (pp. 173-176).
|
Berg, M.T. de, Goaoc, X. & Stappen, A.F. van der (2005). A polynomial-time algorithm to design push plans for sensorless parts sorting. In Proceedings of Robotics: Science and Systems (pp. 89-95).
|
Cabello, S., Berg, M.T. de & Kreveld, M.J. van (2005). Schematization of networks. Comput. Geom. Theory & Appl., 30, 223-238.
|
Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2005). The TSP with neighborhoods of varying size. Journal of Algorithms, 57, 22-36.
|
Berg, M.T. de, Halperin, D. & Overmars, M.H. (2004). An Intersection-Sensitive Algorithm for Snap Routing. (UU-CS 2004-055). Utrecht: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Cabello Justo, S., Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2004). Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. In T. Hagerup & J. Katajainen (Eds.), Algorithm Theory, Proc. 9th Scandinavian Workshop (SWAT 2004) (pp. 138-149). Springer-Verlag.
|
Berg, M.T. de, Cabello Justo, S., Giannopoulos, P. & Veltkamp, R.C. (2004). Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. (UU-CS 2004-014). Utrecht: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Cabello Justo, S., Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2004). Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. In A. Márquez (Ed.), Abstracts of the 20th European Workshop on Computational Geometry (pp. 73-76). Universidad de Sevilla.
|
Dijk, S.F. van, Thierens, D. & Berg, M.T. de (2004). On the design and analysis of competent selecto-recombinative GAs. Evolutionary computation, 12, 243-267.
|
Asano, T., Berg, M.T. de, Cheong, O., Everett, H., Haverkort, H.J., Katoh, M. & Wolff, A. (2004). Optimal Spanners for Axis-Aligned Rectangles. (UU-CS 2004-008). Utrecht: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de & Haverkort, H.J. (2004). Significant-Presence Range Queries in Categorical Data. (UU-CS 2004-009). Utrecht: Utrecht University: Information and Computing Sciences.
|
Arge, L., Berg, M.T. de, Haverkort, H.J. & Yi, K. (2004). The Priority R-Tree: a practically efficient and worst-case-optimal R-tree. (UU-CS 2004-022). Utrecht: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, David, H., Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (2003). Guarding scenes against invasive hypercubes. Computational Geometry: Theory and Applications, 2003(26), 99-117.
|
Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Overmars, M.H. (2003). On R-trees with low query complexity. Computational Geometry: Theory and Applications, 2003(24), 179-195.
|
Berg, M.T. de & Haverkort, H.J. (2003). Significant-Presence Range Queries in Categorical Data. In Significant-Presence Range Queries in Categorical Data. Bonn: Institute of Computer Science I, University of Bonn.
|
Berg, M.T. de & Haverkort, H.J. (2003). Significant-Presence Range Queries in Categorical Data. In F. Dehne, J.-R. Sack & M. Smid (Eds.), Algorithms and Data Structures 8th International Workshop WADS 2003. Berlin/Heidelberg/New York: Springer-Verlag.
|
Berg, M.T. de, Giannopoulos, P., Knauer, C., Oostrum, R.W. van & Veltkamp, R.C. (2003). The Area of Overlap of two Unions of Convex Objects under Translations. (UU-CS 2003-025). Utrecht: Utrecht University, Institute of Information and Computing S.
|
Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2002). Box-Trees and R-Trees with Near-Optimal Query Time. Discrete and Computational Geometry, 28(3), 291-312.
|
Haverkort, H.J. & Berg, M.T. de (2002). Box-Trees for Collision Checking in Industrial Installations. (UU-CS 2002-027). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Haverkort, H.J., Berg, M.T. de & Gudmundsson, J. G. (2002). Box-Trees for Collision Checking in Industrial Installations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 53-62). Barcelona, Spain.
|
Berg, M.T. de, Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (2002). Models and motion planning. Computational Geometry: Theory and Applications, 23, 53-68.
|
Berg, M.T. de, Bose, P., Cheong, O. & Morin, P.J. (2002). On Simplifying Dot Maps. (UU-CS 2002-038). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Dijk, S.F. van, Thierens, D. & Berg, M.T. de (2002). On the design and analysis of competent GAs. (UU-CS 2002-015). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de & Stappen, A.F. van der (2002). On the fatness of Minkowski sums. Information Processing Letters, 81, 259-264.
|
Berg, M.T. de, Katz, M.J., Stappen, A.F. van der & Vleugels, J.M. (2002). Realistic input models for geometric algorithms. Algorithmica, 34, 81-97.
|
Agarwal, P.K., Berg, M.T. de, Har-Peled, S., Overmars, M.H., Sharir, M. & Vahrenholdt, J. (2002). Reporting intersecting pairs of convex polytopes in two and three dimensions. Computational Geometry: Theory and Applications, 23, 195-208.
|
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.
|
Ahn, H.K., Berg, M.T. de, Bose, J., Cheng, S.W., Halperin, D., Matousek, J. & Schwarzkopf, O. (2002). Separating an obkect from its cast. Computer-Aided Design, 34, 547-559.
|
Asano, T., Berg, M.T. de, Cheong, O., Guibas, L.J., Snoeyink, J. & Tamaki, H. (2002). Spanning trees crossing few barriers. (UU-CS 2002-012). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2002). TSP with Neighborhoods of Varying Size. (UU-CS 2002-036). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2002). TSP with neighborhouds of varying size. In Proceedings10th European Symposium on Algorithms ( ESA 2002) (pp. 187-199).
|
Dijk, S.F. van, Thierens, D. & Berg, M.T. de (2002). Using genetic algorithms for solving hard problems in GIS. GeoInformatica, 6(4), 381-413.
|
Berg, M.T. de, Comba, J. & Guibas, L.J. (2001). A segment-tree based kinetic BSP. In Proc. 17th ACM Symposium on Computational Geometry (pp. 134-140). New York: ACM.
|
Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-Trees and R-Trees with Near-Optimal Query Time. (UU-CS 2001-10). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-trees and R-trees with near-optimal query time. In Proc. 17th ACM Symposium on Computational Geometry (pp. 124-133). New York: ACM.
|
Agarwal, P.K., Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Haverkort, H.J. (2001). Box-trees and R-trees with near-optimal query time. In R.L. Lagendijk, J.W.J. Heijnsdijk, A.D. Pimentel & M.H.F. Wilkinson (Eds.), ASCI: Proc. 7th Annual Conference of the Advanced School for Computing and Imaging (pp. 283-290). Delft: Advanced School for Computing and Imaging.
|
Dijk, S.F. van, Thierens, D. & Berg, M.T. de (2001). Designing Genetic Algorithms to Solve GIS Problems. In R. Krzanowski & J. Raper (Eds.), Spatial Evolutionary Modeling (pp. 158-180). New York: Oxford University Press.
|
Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Overmars, M.H. (2001). On R-trees with low query complexity. (UU-CS 2001-21). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Agarwal, P.K., Berg, M.T. de, Har-Peled, S., Overmars, M.H., Sharir, M. & Vahrenhold, J. (2001). Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. In F. Dehne, J.R. Sack & R. Tamassia (Eds.), Proceedings WADS 2001 (pp. 122-134). Berlin, Germany: Springer-Verlag.
|
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.
|
Berg, M.T. de, Kreveld, M.J. van, Overmars, M.H. & Schwarzkopf, O. (2000). Computational Geometry: Algorithms and Applications (second edition). Heidelberg: Springer-Verlag.
|
Berg, M.T. de, Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (2000). Guarding scenes against invasive hypercubes. (UU-CS 2000-40). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de (2000). Linear size binary space partitions for uncluttered scenes. Algorithmica, 28, 353-366.
|
Berg, M.T. de, Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (2000). Models and motion planning. (UU-CS 2000-41). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Dijk, S.F. van, Thierens, D. & Berg, M.T. de (2000). Scalability and Efficiency of Genetic Algorithms for Geometrical Applications. In M. Deb Schoenauer, R. Yao Günter, E. Merelo Lutton & H.P. Schwefel (Eds.), Lecture Notes in Computer Science 1917: Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature (pp. 683-692). Berlijn Heidelberg: Springer-Verlag.
|
Berg, M.T. de (Ed.). (2000). Computational Geometry: Theory and Applications.
|
Thierens, D., Berg, M.T. de & Dijk, S.F. van (2000). Using genetic algorithms for solving hard problems in GIS. (UU-CS 2000-32). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Agarwal, P.K., Basch, J., Berg, M.T. de, Guibas, L.J. & Hershberger, J. (1999). Lower bounds for kinetic planar subdivisions. (UU-CS 1999-40). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Agarwal, P.K., Basch, J., Berg, M.T. de, Guibas, L.J. & Hershberger, J. (1999). Lower bounds for kinetic planar subdivisions. In Proceedings 15th Annual ACM Symposium on Computational Geometry (pp. 247-254). New York: ACM Press.
|
Aronov, B., Berg, M.T. de, Stappen, A.F. van der, Svestka, P. & Vleugels, J.M. (1999). Motion planning for multiple robots. Discrete and Computational Geometry, 4, 481-504.
|
Ferragina, P., Muthukrishnan, S. & Berg, M.T. de (1999). Multi-method dispatching: a geometric approach with applications to string matching. In Proceedings 31st Annual ACM Symposium on the Theory of Computing (pp. 483-491). New York: ACM Press.
|
Dijk, S.F. van, Thierens, D. & Berg, M.T. de (1999). On the Design of Genetic Algorithms for Geographical Applications. In W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela & R.E. Smith (Eds.), GECCO'99 Proceedings of the Genetic and Evolutionary Computation Conference (pp. 188-195). San Francisco, CA: Morgan Kaufmann.
|
Berg, M.T. de & Stappen, A.F. van der (1999). On the fatness of Minkowski sums. (UU-CS 1999-39). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Asano, T., Cheong, O., Berg, M.T. de, Guibas, L.J., Snoeyink, J. & Tamaki, H. (1999). Spanning trees crossing few barriers. In Proceedings 15st Annual ACM Symposium on the Theory of Computing (pp. 41-48). New York: ACM Press.
|
Berg, M.T. de, Bose, P., Bremner, D., Ramaswami, S. & Wilfong, G. (1998). Computing constrained minimum-width annuli of point sets. Journal of computer-aided molecular design, 30(4), 267-275.
|
Berg, M.T. de, Meijer, H.J.M, Overmars, M.H. & Wilfong, G. (1998). Computing the angularity tolerance. International journal of computational geometry & applications, 8, 467-467.
|
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.
|
Agarwal, P.K., Berg, M.T. de, Matousek, J. & Schwarzkopf, O. (1998). Construction levels in arrangements and higher order Voronoi diagrams. SIAM Journal on Computing, 27, 654-667.
|
Berg, M.T. de, David, H., Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (1998). Guarding scenes against invasive hypercubes. In Proceedings of the 2nd Workshop on Algorithm Engineering.
|
Berg, M.T. de (1998). Linear size binary space partitions for uncluttered scenes. (UU-CS 1998-12). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (1998). Models and motion planning. In Proceedings 6th Scandinavian Workshop Algorithm Theory (pp. 83-94). Springer Verlag.
|
Aronov, B., Berg, M.T. de, Stappen, A.F. van der, Svestka, P. & Vleugels, J.M. (1998). Motion planning for multiple robots. (UU-CS 1998-30). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Aronov, B., Berg, M.T. de, Stappen, A.F. van der, Svestka, P. & Vleugels, J.M. (1998). Motion planning for multiple robots. In Proceedings of the 14th ACM Symposium on Computational Geometry (pp. 374-382). New York, U.S.A.: ACM Press.
|
Stappen, A.F. van der, Overmars, M.H., Berg, M.T. de & Vleugels, J.M. (1998). Motion planning in environments with low obstacle density. Discrete and Computational Geometry, 20, 561-587.
|
Berg, M.T. de & Dobrindt, K. (1998). On levels of details in terrains. Graphical models and image processing, 60(1), 1-12.
|
Berg, M.T. de, Katz, M.J., Stappen, A.F. van der & Vleugels, J.M. (1998). Realistic input models for geometric algorithms. (UU-CS 1998-13). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Bose, P., Bremner, D., Evans, W. & Narayanan, L. (1998). Recovering lines with fixed linear probes. In Proceedings of the 10th Canadian Conference on Computational Geometry.
|
Thierens, D., Berg, M.T. de & Dijk, S.F. van (1998). Robust genetic algorithms for high quality map labeling. (UU-CS 1998-41). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Ahn, H.K., Berg, M.T. de & Cheong, O. (1998). Separating an object from its cast. (UU-CS 1998-16). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Everett, H. & Guibas, L.J. (1998). The union of moving polygonal pseudodiscs combinatorial bounds and applications. Computational Geometry: Theory and Applications, 11, 69-82.
|
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.
|
Berg, M.T. de, Kreveld, M.J. van & Overmars, M.H. (1997). Computational Geometry: Algorithms and Applications. Heidelberg, Germany: Springer Verlag.
|
Berg, M.T. de & Cheong, O. (1997). Computing a single cell in the overlay of two simple polygons. (UU-CS 1997-15). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Devillers, O., Dobrindt, K. & Schwarzkopf, O. (1997). Computing a single cell in the union of two simple polygons. Information Processing Letters, 63, 215-219.
|
Berg, M.T. de, Bose, J., Bremmer, D., Ramaswami, S. & Wilfong, G. (1997). Computing constrained minimum-width annuli of point sets. In Proceedings 13th Workshop on Algorithms and Data Structures (pp. 3-16). New York, U.S.A.: Springer Verlag.
|
Stappen, A.F. van der, Overmars, M.H., Berg, M.T. de & Vleugels, J.M. (1997). Motion planning in environments with low obstacle density. (UU-CS 1997-19). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Groot, M. de & Overmars, M.H. (1997). New results on binary space partitions in the plane. Computational Geometry: Theory and Applications, 8, 317-333.
|
Berg, M.T. de, Groot, M. de & Overmars, M.H. (1997). Perfect binary space partitions. Computational Geometry: Theory and Applications, 7, 81-91.
|
Berg, M.T. de, Katz, M.J., Stappen, A.F. van der & Vleugels, J.M. (1997). Realistic input models for geometric algorithms. In Proceedings 13th Annual ACM Symposium on Computational Geometry (pp. 294-303). New York, U.S.A.: ACM Press.
|
Ahn, H.K., Berg, M.T. de, Bose, J., Cheng, S.W., Halperin, D. & Matouvsek, J. (1997). Separating an object from its cast. In Proceedings 13th Annual ACM Symposium on Computational Geometry (pp. 61-83). New York, U.S.A.: ACM Press.
|
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.
|
Berg, M.T. de (1997). Trends and developments in computational geometry. Computer Graphics Forum, 16, 3-30.
|
Berg, M.T. de (1997). Visualization of TINs. (UU-CS 1997-22). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de (1997). Visualization of TINs. In M.J. van Kreveld, J. Nievergelt, T. Roos & P. Widmayer (Eds.), In Algorithmic Foundations of Geographic Information Systems (pp. 79-97). Berlin, Germany: Springer Verlag.
|
Berg, M.T. de (1996). Computing constrained minimum-width annuli of point sets. (UU-CS 1996-54). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de (1996). Computing half-plane and strip discrepancy of planar point sets. Computational Geometry: Theory and Applications, 6, 69-83.
|
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, Meijer, H.J.M, Overmars, M.H. & Wilfong, G. (1996). Computing the angularity tolerance. In Proceedings of the 8th Canadian Conference on Computational Geometry (pp. 331-336). Ottawa, Canada: Carleton University Press.
|
Berg, M.T. de, Meijer, H. & Overmars, M.H. (1996). Computing the angularity tolerance. (UU-CS 1996-25). 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., Berg, M.T. de, Halperin, D. & Sharir, M. (1996). Efficient generation of k-directional assembly sequences. In Proceedings 7th ACM-SIAM Symposium on Discrete Algorithms (pp. 122-131).
|
Berg, M.T. de (1996). Generalized hidden surface removal. Computational Geometry: Theory and Applications, 5, 249-276.
|
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, Oostrum, R.W. van & Overmars, M.H. (1996). Simple traversal of a subdivision without extra strorage, short communication. In Proceedings of the 12th ACM Symposium on Computational Geometry (pp. C5-C6). New York, U.S.A.: ACM Press.
|
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.
|
Berg, M.T. de, Guibas, L.J. & Halperin, D. (1996). Vertical decompositions for triangles in 3-space. Discrete and Computational Geometry, 15, 35-61.
|
Berg, M.T. de & Kreveld, M.J. van (1995). A new approach to subdivision simplification. (UU-CS 1995-26). Utrecht: Utrecht University.
|
Berg, M.T. de, Agarwal, P.K. & Cheong, O. (1995). Constructing levels in arrangements and higher order Voronoi diagrams. (UU-CS 1995-06). Utrecht: Utrecht University.
|
Berg, M.T. de (1995). On levels of detail in terrains. (UU-CS 1995-12). Utrecht: Utrecht University.
|
Berg, M.T. de (1995). The union of moving polygonal pseudodiscs - combinatorial bounds and applications. (UU-CS 1995-28). Utrecht: Utrecht University.
|
Berg, M.T. de (1995). Trends and Developments in Computational Geometry. (UU-CS 1995-21). Utrecht: Utrecht University.
|
Berg, M.T. de (1994). Computing half-plane and strip discrepancy of planar point sets. (UU-CS 1994-34). Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1994). New Results on Binary Space Partitions in the Plane. (UU-CS 1994-51). Utrecht.
|
Berg, M.T. de & Cheong, O. (1994). On lazy randomized incremental construction. (UU-CS 1994-12). Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Cheong, O. (1994). Reaching a goal with directional uncertainty. (UU-CS 1994-09). Utrecht.
|
Berg, M.T. de & Kreveld, M.J. van (1994). Trekking in the Alps without freezing or getting tired. (UU-CS 1994-02). Utrecht.
|
Berg, M.T. de (1994). Vertical decompositions for triangles in 3-space. (UU-CS 1994-29). Utrecht.
|
Berg, M.T. de (1993). Generalized Hidden Surface Removal. (RUU-CS 93-05). Utrecht.
|
Overmars, M.H. & Berg, M.T. de (1993). Perfect Binary Space Partitions. (RUU-CS 93-23). Utrecht.
|
Berg, M.T. de & Cheong, O. (1993). Piecewise linear paths among convex obstacles. (RUU-CS 93-20). Utrecht.
|
Berg, M.T. de & Kreveld, M.J. van (1993). Rectilinear Decompositions with Low Stabbing Number. (RUU-CS 93-25). Utrecht.
|
Berg, M.T. de & Cheong, O. (1992). Cuttings and Applications. (RUU-CS 92-26). 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.
|
Berg, M.T. de, Overmars, M.H. & Cheong, O. (1991). Computing and verifying depth orders. (RUU-CS 91-41). Utrecht.
|
Berg, M.T. de (1991). Dynamic output-sensitive hidden surface removal for c-Oriented polyhedra. (RUU-CS 91-06). Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1991). Efficient ray shooting and hidden surface removal. (RUU-CS 91-28). 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 (1991). Translating Queries for Sets of polygons. (RUU-CS 91-30). Utrecht.
|
Berg, M.T. de & Kreveld, M.J. van (1991). Two- and three-dimensional point location in Rectangular subdivisions. (RUU-CS 91-29). 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.
|
Berg, M.T. de & Overmars, M.H. (1990). Hidden surface removal for axis-parallel polyhedra (extended abstract). (RUU-CS 90-21). Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1990). Hidden surface removel for $c$-oriented polyhedra. (RUU-CS 90-33). 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.
|
Berg, M.T. de (1989). On rectilinear link distance. (RUU-CS 89-13). Utrecht.
|
Berg, M.T. de (1989). Translating polygons with applications to hidden surface removal. (RUU-CS 89-31). Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1988). A general approach to dominance in the plane. (RUU-CS 88-35). Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1988). Dominance in the presence of obstacles. (RUU-CS 88-10). 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,
Thu, 20 Jun 2013 06:44:42 +0200
←
Departement Informatica, Universiteit Utrecht