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
Motorcycle graphs: canonical quad mesh partitioning
TL;DR: Algorithms for canonically partitioning semi‐regular quadrilateral meshes into structured submeshes using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad meshes are described, which may be used to efficiently find isomorphisms between quad meshes.
Book
Data structures and algorithms in C
TL;DR: This book presents even the most difficult mathematical concepts clearly, and emphasizes the practical application of the latest software engineering practices.
Proceedings ArticleDOI
Efficient plane sweeping in parallel
TL;DR: This work presents techniques which result in improved parallel algorithms for a number of problems whose efficient sequential algorithms use the plane-sweeping paradigm, and never uses the AKS sorting network in any of them.
Book ChapterDOI
Succinct Greedy Geometric Routing in the Euclidean Plane
TL;DR: In this article, greedy geometric routing schemes for the Euclidean metric in R 2, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(logn) bits, where n is the number of vertices in the graph.
Book
Algorithm Design and Applications
TL;DR: Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia teaches students about designing and using algorithms, illustrating connections between topics being taught and their potential applications, increasing engagement.