73 citations · 634 across the 97 of their papers we have counts for
5 papers · 2 filters
Achieving Good Angular Resolution in 3D Arc Diagrams
Michael T. Goodrich, Paweł Pszona
We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3…
Streamed Graph Drawing and the File Maintenance Problem
Michael T. Goodrich, Paweł Pszona
In streamed graph drawing, a planar graph, G, is given incrementally as a data stream and a straight-line drawing of G must be updated after each new edge is released. To preserve…
Set-Difference Range Queries
David Eppstein, Michael T. Goodrich, Joseph A. Simons
We introduce the problem of performing set-difference range queries, where answers to queries are set-theoretic symmetric differences between sets of items in two geometric ranges.…
Cole's Parametric Search Technique Made Practical
Michael T. Goodrich, Paweł Pszona
Parametric search has been widely used in geometric algorithms. Cole's improvement provides a way of saving a logarithmic factor in the running time over what is achievable using t…
Combinatorial Pair Testing: Distinguishing Workers from Slackers
David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
We formalize a problem we call combinatorial pair testing (CPT), which has applications to the identification of uncooperative or unproductive participants in pair programming, mas…