Matthias Müller-Hannemann research assistant at our group until 2000 Home Page in Darmstadt! Address: Dr. Matthias Müller-Hannemann Technische Universität Darmstadt Fachbereich Informatik Wilhelminenstr. 7 64283 Darmstadt Germany building S4/03, room B110 phone: +49-6151-16-3451 fax: +49-6151-16-4025 email: muellerh@algo.informatik.tu-darmstadt.de

Research Interests:

• Mesh Generation and Refinement
• Quadrilateral Surface Meshing
• Hexahedral Mesh Generation
• Network Flows and Matching
• Approximation Algorithms
• Combinatorial Optimization
• Computational Geometry
• Empirical Studies

Recent Work:

• Mesh generation and refinement (project page)

  There is also a project description in German ( Projektbeschreibung in deutscher Sprache ).

  (click on figures)

  Visit our little ``Picture Galleries'' to see more examples:
  • quadrilateral surface meshes
  • hexahedral meshes.
  See also a movie (animated gif, 1.6MB (large !)), presenting the refinement of a model of a shaft with a flange.

• weighted b-matching

  Together with Alexander Schwartz we maintain a ``b-matching resource page'' on computational and experimental aspects, including synthetic and real-world instances, an instance generator written in C++, and a bibliography.

Publications and Preprints:

Mesh generation and refinement (quadrilateral surface and hexahedral volume meshing):

• Hexhahedral Mesh Generation for the Simulation of the Human Mandible
• Improving the Surface Cycle Structure for Hexahedral Mesh Generation
• Kombinatorische Algorithmen zur Netzgenerierung im CAD (in German)
• Combinatorics Helps for Hexahedral Mesh Generation in CAD
• Hexahedral Mesh Generation by Successive Dual Cycle Elimination
• On the Discrete Core of Quadrilateral Mesh Refinement
• Quadrilateral Mesh Generation in Computer-Aided Design
• High Quality Quadrilateral Surface Meshing Without Template Restrictions: A New Approach Based on Network Flow Techniques
• Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals
• Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes
• Minimum Strictly Convex Quadrangulations of Convex Polygons
• Mesh Refinement via Bidirected Flows: Modeling, Complexity, and Computational Results
• Using Network Flows For Surface Modeling

Matching (b-matching, cardinality matching):

• Implementing Weighted b-Matching Algorithms: Insights From a Computational Study
• Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design
• Cardinality Matching: Heuristic Search for Augmenting Paths

Algorithm engineering:

• Empirical Design of Geometric Algorithms

Events where we could have met or can meet in the future

Academic degrees:

• Diplom (Mathematics), TU Berlin, May 1994
• Dr. rer. nat. (Mathematics), TU Berlin, September 1997