M
Michael T. Goodrich
Researcher at University of California, Irvine
Publications - 445
Citations - 14652
Michael T. Goodrich is an academic researcher from University of California, Irvine. The author has contributed to research in topics: Planar graph & Time complexity. The author has an hindex of 61, co-authored 430 publications receiving 14045 citations. Previous affiliations of Michael T. Goodrich include New York University & Technion – Israel Institute of Technology.
Papers
More filters
Journal ArticleDOI
On the algorithmic complexity of the Mastermind game with black-peg results
TL;DR: It is shown that it is NP-complete to determine if a sequence of single- color Mastermind results have a satisfying vector, and how to devise efficient algorithms for discovering a hidden vector through single-color queries.
Proceedings Article
Planar Orthogonal and Polyline Drawing Algorithms.
TL;DR: The University of California, Irvine 7.7.2018 as discussed by the authors 7.5.2018 2.0/1/1-1/2/1.0 0.0
Journal ArticleDOI
Lombardi drawings of graphs
Christian A. Duncan,David Eppstein,Michael T. Goodrich,Stephen G. Kobourov,Martin Nöllenburg +4 more
TL;DR: Lombardi drawings as mentioned in this paper represent edges as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex.
Journal ArticleDOI
Optimizing area and aspect ratio in straight-line orthogonal tree drawings
TL;DR: This work investigates the problem of drawing an arbitrary n-node binary tree orthogonally and upwardly in an integer grid using straight-line edges and shows that one can simultaneously achieve good area bounds and achieve an additional desirable aesthetic criterion, which is called "subtree separation".
Journal ArticleDOI
Triangulating a polygon in parallel
TL;DR: The algorithm presented runs in O (log n ) time using O ( n ) processors, which is optimal if the polygon is allowed to contain holes, which improves the previous parallel complexity bounds for this problem by a log n factor.