Matthew Dickerson

Publication Activity (10 Years)

Years Active: 1989-2013
Publications (10 Years): 0

Top Topics

Distance Function

K Nearest Neighbor

Top Venues

J. Comput. Sci. Technol.

Publications

Gill Barequet, Matthew Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina
On 2-Site Voronoi Diagrams Under Geometric Distance Functions. J. Comput. Sci. Technol. 28 (2) (2013)
Matthew Dickerson, David Eppstein, Kevin A. Wortman
Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ISVD (2010)
Roman Petrenko, Matthew Dickerson, Rajesh Naik, Soumya Patnaik, Thomas Beck, Jaroslaw Meller
Entropic Force in Drosophila Resilin: Molecular Dynamics Study. BIOCOMP (2009)
Matthew Dickerson, David Eppstein, Kevin A. Wortman
Dilation, smoothed distance, and minimization diagrams of convex functions CoRR (2008)
Sam Stover, Matthew Dickerson
Using Memory Dumps in Digital Forensics. login Usenix Mag. 30 (6) (2005)
Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms Appl. 9 (1) (2005)
Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Graph Drawing (2003)
Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way CoRR (2002)
Matthew Dickerson, Michael T. Goodrich
Matching points to a convex polygonal boundary. CCCG (2001)
Gill Barequet, Matthew Dickerson, Michael T. Goodrich
Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discret. Comput. Geom. 25 (2) (2001)
Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin
2-point site Voronoi diagrams. SCG (2001)
Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
K-D Trees Are Better when Cut on the Longest Side. ESA (2000)
Gill Barequet, Matthew Dickerson
The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. CCCG (2000)
Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III
2-Point Site Voronoi Diagrams. WADS (1999)
Gill Barequet, Prosenjit Bose, Matthew Dickerson
Optimizing Constrained Offset and Scaled Polygonal Annuli. WADS (1999)
Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
Offset-polygon annulus placement problems. Comput. Geom. 11 (3-4) (1998)
Matthew Dickerson, Daniel Scharstein
Optimal placement of convex polygons to maximize point containment. Comput. Geom. 11 (1) (1998)
Gill Barequet, Matthew Dickerson, David Eppstein
On triangulating three-dimensional polygons. Comput. Geom. 10 (3) (1998)
Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich
Animating the Polygon-Offset Distance Function. SCG (1997)
Matthew Dickerson, J. Mark Keil, Mark H. Montague
A Large Subgraph of the Minimum Weight Triangulation. Discret. Comput. Geom. 18 (3) (1997)
Gill Barequet, Matthew Dickerson, Michael T. Goodrich
Voronoi Diagrams for Polygon-Offset Distance Functions. WADS (1997)
Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
Fast Greedy Triangulation Algorithms. Comput. Geom. 8 (1997)
Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
Offset-Polygon Annulus Placement Problems. WADS (1997)
Matthew Dickerson, Daniel Scharstein
The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. SCG (1996)
Matthew Dickerson, Daniel Scharstein
Optimal Placement of Convex Polygons to Maximize Point Containment. SODA (1996)
Matthew Dickerson, Mark H. Montague
A (Usually?) Connected Subgraph of the Minimum Weight Triangulation. SCG (1996)
Gill Barequet, Matthew Dickerson, David Eppstein
On Triangulating Three-Dimensional Polygons. SCG (1996)
Gill Barequet, Matthew Dickerson, Petru Pau
Translating a convex polygon to contain maximum number of points. CCCG (1995)
Matthew Dickerson, David Eppstein
Algorithms for Proximity Problems in Higher Dimensions. Comput. Geom. 5 (1995)
Matthew Dickerson, Scott A. McElfresh, Mark H. Montague
New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract). SCG (1995)
Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
Fast Greedy Triangulation Algorithms. SCG (1994)
Matthew Dickerson
General Polynomial Decomposition and the s-1-Decomposition are NP-Hard. Int. J. Found. Comput. Sci. 4 (2) (1993)
Matthew Dickerson, Jason Shugart
A Simple Algorithm for Enumerating Longest Distances in the Plane. Inf. Process. Lett. 45 (5) (1993)
Matthew Dickerson
The Inverse of an Automorphism in Polynomial Time. J. Symb. Comput. 13 (2) (1992)
Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack
Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. Int. J. Comput. Geom. Appl. 2 (3) (1992)
Matthew Dickerson, Robert L. (Scot) Drysdale III
Points in the Plane. SCG (1991)
Matthew Dickerson, Robert L. (Scot) Drysdale III
Fixed-Radius Near Neighbors Search Algorithms for Points and Segments. Inf. Process. Lett. 35 (5) (1990)
Matthew Dickerson
The Inverse of an Automorphism in Polynomial Time FOCS (1989)