де Берг Марк

Учёное звание: prof.dr. M.T.

Магистерская программа "Системная и программная инженерия": научный руководитель

Образование

2003 Seminar Management Leergang TU/e. An 8-day management course for the senior faculty of the TU/e.

2001 Seminar Begeleiden en sturen van wetenschappelijke professionals. A 5-day course on coaching skills for the senior faculty of Utrecht University.

1999 Senior Qualification Research.

In 1995, Utrecht University introduced the so-called WP-FLOW program (Regeling Wetenschappelijk Personeel—Functies, Loopbanen en Waardering). Part of this program was the introduction of basic and senior qualifications for teaching and research. The Senior Qualification Research is given to experienced researchers of international standing.

1996 Basic Qualification Teaching.

1988–1991 Ph.D. student, Utrecht University. PhD degree in computer science in March 1992. Title of PhD thesis: Efficient Algorithms for Ray Shooting and Hidden Surface Removal. A revised version of this PhD thesis was published in Springer-Verlag’s series Lecture Notes in Computer Science.

1984–1988 Study Computer Science, Utrecht University. MSc degree in computer science in June 1988. Title of MSc thesis: Visibility Problems.

1978–1984 High school: Chr. College Nassau-Veluwe, Harderwijk. Graduated in 1984.

Биография

nov 2002–now Full professor at the computer science department of the Faculty of Mathematics and Computer Science at the TU Eindhoven.

1999–2002 Associate professor at the Institute for Information and Computing Sciences at Utrecht University.

summer 1998 Visiting researcher at Stanford University (USA).

1996–1999 Assistant professor at the Institute for Information and Computing Sciences at Utrecht University.

1992–1995 Scientific researcher at Utrecht University, in the PIONIER project Computational Geometry and its Application.

1988–1991 PhD student, Utrecht University.

1985–1991 Teaching assistant for various courses, Utrecht University.

Учебные курсы

• Advanced Algorithms (TU/e, 2007, 2008, 2009, 2010)

• Data structures (2011)

• Design of Algorithms 2 (TU/e: 2005, 2006)

• OGO 2.1 (TU/e: 2003, 2004, 2005)

• Design of Algorithms 3 (TU/e: 2003, 2004, 2005)

• I/O-Efficient Algorithms (TU/e: 2003)

• Algorithms (UU: 2001)

• Geometric algorithms (UU: 1996, 1997, 1999, 2002)

• Computational geometry (UU: 2001, for PhD students in the research school ASCI; 1996, 1997,1998 for PhD students at Utrecht University)

• Algorithms and Data structures I (UU: 1997, 1998)

• Geometric algorithms for elevation models (UU: 1995, seminar; with M. van Kreveld)

• Computational geometry and computer graphics (UU: 1992, seminar; with M. Overmars).

Публикации

Книги

M. de Berg. Ray Shooting, Depth Orders and Hidden Surface Removal. Lecture Notes in Computer Science 703, Springer-Verlag, Berlin, 1993.
M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg. The first edition appeared in 1997, the second edition in 2000, and the third edition in 2008. There is also a Japanese translation (2000), a Chinese translation (2007), and a Polish translation (2007).

Главы в книгах

M. de Berg. Trends and Developments in Computational Geometry. In: R. Veltkamp (ed.), Eurographics’95—State Of The Art Reports. pages 25–60, 1995.
M. de Berg. Visualization of TINs. M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer (eds.),Algorithmic Foundations of Geographic Information Systems, Lecture Notes in Computer Science1340, pages 79–97, 1997.
S. van Dijk, D. Thierens, and M. de Berg. Designing Genetic Algorithms to Solve GIS-Problems. In: R.M. Krzanowski and J. Raper (eds.), Spatial Evolutionary Modeling, Oxford University Press, 2001.
M. de Berg and B. Speckmann. Computational Geometry: Fundamental Structures. D.P. Mehta and S. Sahni (Eds.), Handbook of Data Structures and Applications, CRC Press, pages 62-1 – 62-20,2005.С

Статьи в журналах

M.H. Overmars, M.H.M. Smid, M.T. de Berg, and M.J. van Kreveld. Maintaining range trees in secondary memory, Part I: Partitions. Acta Informatica 27:423–452 (1990).
M. de Berg, M. Overmars, and M. van Kreveld. Finding complete bipartite subgraphs in bipartite graphs. Algorithms Review 1:79–86 (1990).
M.J. van Kreveld and M.T. de Berg. Finding squares and rectangles in sets of points. BIT 31:202-219 (1991).
M. de Berg. On rectilinear link distance. Computational Geometry: Theory and Applications 1:13–34 (1991).
M.T. de Berg, S. Carlsson, and M.H. Overmars. A general approach to dominance in the plane. J.Algorithms 13:274–296 (1992).
M. de Berg and M. Overmars. Hidden surface removal for c–oriented polyhedra. Computational Geometry: Theory and Applications 1:247–268 (1992).
M. de Berg. Dynamic output-sensitive hidden surface removal for c-oriented polyhedra. Computational Geometry: Theory and Applications 2:119–140 (1992).
M. de Berg, M. van Kreveld, B. Nilsson, and M. Overmars. Shortest path queries in rectilinear worlds. International Journal of Computational Geometry & Applications 2:287–309 (1992). (Special Issue on the 7th ACM Symp. on Computational Geometry.)
M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld. Efficient ray shooting and hidden surface removal. Algorithmica 12:30–53 (1994).
M. de Berg, M. Overmars, and O. Schwarzkopf. Computing and verifying depth orders. SIAM J. Comput. 23:437–446 (1994).
M. de Berg and M. van Kreveld. Rectilinar decompositions with low stabbing number. Inform. Process. Lett. 52:215–221 (1994).
M. de Berg, M. van Kreveld, and J. Snoeyink. Two- and three-dimensional point location in rectangular subdivisions. J. Algorithms 18:256–277 (1995).
M. de Berg, H. Everett, and H. Wagener, Translation queries for sets of polygons. International Journal of Computational Geometry & Applications. 5:221–242 (1995).