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
Book ChapterDOI
A Framework for Drawing Planar Graphs with Curves and Polylines
TL;DR: A unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves, including aspect ratio, vertex resolution, edge length, edge separation, and edge curvature is described.
Proceedings ArticleDOI
Teaching data structure design patterns
TL;DR: This paper surveys several design patterns and describes how they can be naturally integrated in the CS2 curriculum and provides an introduction to object-oriented software engineering patterns in addition to the theory of data structures.
Journal ArticleDOI
Deterministic sampling and range counting in geometric data streams
TL;DR: In this article, memory-efficient deterministic algorithms for constructing e-nets and e-approximations of streams of geometric data are presented, provided the desired approximation factors are at least inverse-polylogarithmic.
Posted Content
Force-Directed Graph Drawing Using Social Gravity and Scaling
TL;DR: Techniques for using social gravity as an additional force in force-directed layouts, together with a scaling technique, are presented, to produce drawings of trees and forests, as well as more complex social networks.
Journal ArticleDOI
Efficient verification of web-content searching through authenticated web crawlers
Michael T. Goodrich,Charalampos Papamanthou,Duy Lap Nguyen,Roberto Tamassia,Cristina V. Lopes,Olga Ohrimenko,Nikos Triandopoulos +6 more
TL;DR: The concept of an authenticated web crawler is introduced and its design and prototype implementation are presented, which provides a low communication overhead between the search engine and the user, and fast verification of the returned results by the user.