Michael B. Dillencourt
Associate Professor, Theory
Donald Bren School of Information and Computer Sciences
Donald Bren School of Information and Computer Sciences
University of California, Irvine
352B CS
Mail Code: 3425
Irvine, CA 92697
352B CS
Mail Code: 3425
Irvine, CA 92697
Research Interests
Analysis of algorithms; Data structures; Computational geometry; Graph algorithms; Computer graphics; Computer vision; Distributed computing
Websites
Academic Distinctions
Appointments
Research Abstract
Dr. Dillencourt's research interests involve the analysis and design of algorithms and data structures. He is particularly interested in the areas of computational geometry and graph theory, and in the interplay between these two areas.
Within the area of computational geometry, Dr. Dillencourt has investigated the structure of Delaunay triangulations and the closely related family of inscribable polyhedra. Many problems in pattern recognition, statistics, image processing, and related fields can be concisely formulated as graph-theoretical questions about these objects.
Dr. Dillencourt has also examined techniques for reducing the storage requirement of commonly-used structures for storing spatial data. He has developed efficient algorithms for component-labeling and boundary-extraction in binary images that are applicable to a wide variety of image-representation schemes.
Dr. Dillencourt and his students are developing an environment for doing computer-assisted research in graph theory and combinatorial geometry. They have developed GraphTool, a tool to support the development and analysis of algorithms in graph theory and computational geometry, and they have developed a large database of polyhedra.
Within the area of computational geometry, Dr. Dillencourt has investigated the structure of Delaunay triangulations and the closely related family of inscribable polyhedra. Many problems in pattern recognition, statistics, image processing, and related fields can be concisely formulated as graph-theoretical questions about these objects.
Dr. Dillencourt has also examined techniques for reducing the storage requirement of commonly-used structures for storing spatial data. He has developed efficient algorithms for component-labeling and boundary-extraction in binary images that are applicable to a wide variety of image-representation schemes.
Dr. Dillencourt and his students are developing an environment for doing computer-assisted research in graph theory and combinatorial geometry. They have developed GraphTool, a tool to support the development and analysis of algorithms in graph theory and computational geometry, and they have developed a large database of polyhedra.
Publications
M. B. Dillencourt and W. D. Smith, A Simple Method for Completing Degenerate Delaunay Tessellations, To appear in Computational Geometry: Theory & Applications.
M. Fukuda, L . F. Bic, M. B. Dillencourt, and F. Merchant, Distributed Coordination with MESSENGERS, To appear in Science of Computer Programming.
M. Fukuda, L . F. Bic, M. B. Dillencourt, and F. Merchant, MESSENGERS: Distributed Programming Using Mobile Autonomous Objects, To appear in Journal of Information Sciences.
T. K. Dey, M. B. Dillencourt, S. K. Ghosh, and J. M. Cahill, Triangulating with High Connectivity, Computational Geometry: Theory & Applications, 8(1), June 1997, 39-56.
Link to this profile
https://faculty.uci.edu/profile/?facultyId=2267
https://faculty.uci.edu/profile/?facultyId=2267
Last updated
04/01/2002
04/01/2002