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
Proceedings Article
An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version)
TL;DR: An algorithm for the hidden-surface elimination problem for rectangles, which is also known as window rendering, which obtains a trade-off between these two components, in that its running time is O(r(n1+1/r+κ)), where 1≤r≤log n is a tunable parameter.
Book ChapterDOI
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.
Book ChapterDOI
An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal
TL;DR: In this paper, the authors present an algorithm for the hidden surface elimination problem for rectangles, which is also known as window rendering, with running time O(r(n1+1/r+κ)), where 1≤r≤log n is a tunable parameter.
Proceedings ArticleDOI
Leap-frog packet linking and diverse key distributions for improved integrity in network broadcasts
TL;DR: Two new approaches to improving the integrity of network broadcasts and multicasts with low storage and computation overhead are presented, including a leapfrog linking protocol and a novel key predistribution scheme that allows end-to-end integrity checking as well as improved hop-by-hop integrity checking.
Posted Content
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
TL;DR: In this article, a planar straight-line drawing of a combinatorially-embedded genus-g graph with the graph's canonical polygonal schema drawn as a convex polygon's external face is presented.