Showing papers by "Michael T. Goodrich published in 2015"
Book•
09 Sep 2015TL;DR: In this article, the authors present techniques for parallel divide-and-conquer, resulting in improved parallel algorithms for a number of problems including intersection detection, trapezoidal decomposition, and planar point location.
Abstract: We present techniques for parallel divide-and-conquer, resulting in improved parallel algorithms for a number of problems. The problems for which we give improved algorithms include intersection detection, trapezoidal decomposition (hence, polygon triangulation), and planar point location (hence, Voronoi diagram construction). We also give efficient parallel algorithms for fractional cascading, 3-dimensional maxima, 2-set dominance counting, and visibility from a point. All of our algorithms run in O(log n) time with either a linear or sub-linear number of processors in the CREW PRAM model.
162 citations
Book•
01 Jan 2015
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.
Abstract: Introducing a NEW addition to our growing library of computer science titles,Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are expected to learn how algorithms can be applied to a variety of contexts. This new book integrates application with theory. Goodrich & Tamassia believe that the best way to teach algorithmic topics is to present them in a context that is motivated from applications to uses in society, computer games, computing industry, science, engineering, and the internet. The text teaches students about designing and using algorithms, illustrating connections between topics being taught and their potential applications, increasing engagement.
65 citations
Posted Content•
TL;DR: In this paper, the authors show how to provide privacy-preserving (zero-knowledge) answers to order queries on network data that is organized in lists, trees, and partially ordered sets of bounded dimension.
Abstract: We show how to provide privacy-preserving (zero-knowledge) answers to order queries on network data that is organized in lists, trees, and partially-ordered sets of bounded dimension. Our methods are efficient and dynamic, in that they allow for updates in the ordering information while also providing for quick and verifiable answers to queries that reveal no information besides the answers to the queries themselves.
15 citations
TL;DR: In this paper, the authors use Galois theory to show that many variants of graph drawing problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials.
Abstract: Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than constructing and then solving algebraic expressions representing their exact solutions. To explain this phenomenon, we use Galois theory to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials. Hence, such solutions cannot be computed exactly even in extended computational models that include such operations.
3 citations
Posted Content•
TL;DR: In this paper, Knuth describes an algorithm that takes as input an n-vertex directed graph G that represents a flowchart and produces an orthogonal drawing of G.
Abstract: Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends.
24 Sep 2015
TL;DR: In this paper, an n-vertex directed graph G represents a flowchart and, using the modern language of graph drawing, produces an orthogonal drawing of the flowchart.
Abstract: In 1963, Knuth published the first paper on a computer algorithm for a graph drawing problem, entitled "Computer-drawn Flowcharts"i¾?[8]. In this paper, Knuth describes an algorithm that takes as input an n-vertex directed graph G that represents a flowchart and, using the modern language of graph drawing, produces an orthogonal drawing of G.