# Matthew T Dickerson

• J. Graph Algorithms Appl.
• 2003
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach allows us to draw, in a crossing-free manner, graphs—such as software interaction diagrams—that would normally have many crossings. The main idea of this approach is quite simple: we(More)
• Symposium on Computational Geometry
• 1996
that computes a subgraph of the minimum weight triangulation (A4WL”) of a general point set. The algorithm works by finding a collection of edges guaranteed to be in any locally minimal triangulation. We call this subgraph the LMT-skeleton. We also give two variants of our algorithm that produce a more complete subgraph of the MWT: an extended LMT-skeleton(More)
• SODA
• 1996
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a placement of P that contains the maximum number of points in S. We allow both translation and rotation. Our algorithm is self-contained and utilizes the geometric properties of the containing regions in the parameter space of transformations.(More)
• Symposium on Computational Geometry
• 1996
A three-dimensional polygon is triangulable if it has a non-self-intersecting triangulation which definea a simply-connected 2-manifold. We show that the problem of deciding whether a 3D polygon is triangulable is an NP-complete problem. We then establish some necessary conditions and some sufhcient conditions for a polygon to be triangttlable, providing(More)
• Symposium on Computational Geometry
• 1995
number of edges points examined. The weight of a triangulation is the sum of the lengths of all the edges in the triangulation. A Mnimum Weight !f%iangtdation (MWT) of a point set S is a triangulation that minimizes weight over all possible triangulations. Wang and Aggarwal [19] and Baraquet and Sharir [1] use the MWT of simple polygons to reconstruct three(More)
• Comput. Geom.
• 1995
We present algorithms for five interdistance enumeration problems that take as input a set S of n points in IRd (for a fixed but arbitrary dimension d) and as output enumerate pairs of points in S satisfying various conditions. We present: an O(n log n + k) time and O(n) space algorithm that takes as additional input a distance δ and outputs all k pairs of(More)
• Symposium on Computational Geometry
• 1994
The greedy triangulation (GT) of a set S of n points in the plane is the triangulation obtained by starting with the empty set and at each step adding the shortest compatible edge between two of the points, where a compatible edge is defined to be an edge that crosses none of the previously added edges. In this paper we present a simple, practical algorithm(More)
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set of n points in IR, for fixed d ≥ 1, using the simple rule of splitting each node’s hyperrectangular region with a hyperplane that cuts the longest side. An interesting(More)