Michael Dillencourt

Dr. Michael Dillencourt is a Professor specializing in computational geometry, graph theory, and distributed computing. His research includes investigations into Delaunay triangulations, inscribable polyhedra, and efficient algorithms for image processing. He holds a Ph.D. from the University of Maryland, awarded in 1988.

Education:

• Ph.D., University of Maryland, 1988

Research Interests:

• Computational Geometry: Focus on structural properties of Delaunay triangulations and inscribable polyhedra.
• Graph Theory: Exploring combinatorial and algorithmic aspects of graphs.
• Distributed Computing: Designing and analyzing algorithms for distributed systems.
• Algorithm Design: Specialization in image-processing techniques like component-labeling and boundary extraction.

Publications: None explicitly listed in the provided text.

Awards/Grants: No honors, grants, or funding details are mentioned.

Advising: No advisees or student collaborations are documented here.

Labs/Teams: No affiliated laboratories or research groups are noted.