Matthew Dickerson

According to our database, Matthew Dickerson authored at least 39 papers between 1989 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

On 2-Site Voronoi Diagrams Under Geometric Distance Functions.

Gill Barequet, Matthew Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina

J. Comput. Sci. Technol., 2013

2011

Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks.

Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson, Ying Daisy Zhuo

Trans. Comput. Sci., 2011

2010

Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks.

Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson

Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation.

Matthew Dickerson, David Eppstein, Kevin A. Wortman

Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Cloning Voronoi Diagrams via Retroactive Data Structures.

Matthew T. Dickerson, David Eppstein, Michael T. Goodrich

Proceedings of the Algorithms, 2010

2009

Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions).

Matthew T. Dickerson, David Eppstein

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Entropic Force in Drosophila Resilin: Molecular Dynamics Study.

Roman Petrenko, Matthew Dickerson, Rajesh Naik, Soumya Patnaik, Thomas Beck, Jaroslaw Meller

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009

2008

Dilation, smoothed distance, and minimization diagrams of convex functions

Matthew Dickerson, David Eppstein, Kevin A. Wortman

CoRR, 2008

Covering points with a polygon.

Gill Barequet, Matthew T. Dickerson, Yuval Scharf

Comput. Geom., 2008

Two-site Voronoi diagrams in geographic networks.

Matthew T. Dickerson, Michael T. Goodrich

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

2005

Using Memory Dumps in Digital Forensics.

Sam Stover, Matthew Dickerson

login Usenix Mag., 2005

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.

Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng

J. Graph Algorithms Appl., 2005

Optimizing a constrained convex polygonal annulus.

Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich

J. Discrete Algorithms, 2005

2002

2-Point site Voronoi diagrams.

Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III

Discret. Appl. Math., 2002

2001

Voronoi Diagrams for Convex Polygon-Offset Distance Functions.

Gill Barequet, Matthew Dickerson, Michael T. Goodrich

Discret. Comput. Geom., 2001

2-point site Voronoi diagrams.

Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Matching points to a convex polygonal boundary.

Matthew Dickerson, Michael T. Goodrich

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

K-D Trees Are Better when Cut on the Longest Side.

Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich

Proceedings of the Algorithms, 2000

The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon.

Gill Barequet, Matthew Dickerson

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999

Optimizing Constrained Offset and Scaled Polygonal Annuli.

Gill Barequet, Prosenjit Bose, Matthew Dickerson

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998

Optimal placement of convex polygons to maximize point containment.

Matthew Dickerson, Daniel Scharstein

Comput. Geom., 1998

On triangulating three-dimensional polygons.

Gill Barequet, Matthew Dickerson, David Eppstein

Comput. Geom., 1998

Offset-polygon annulus placement problems.

Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich

Comput. Geom., 1998

1997

A Large Subgraph of the Minimum Weight Triangulation.

Matthew Dickerson, J. Mark Keil, Mark H. Montague

Discret. Comput. Geom., 1997

Fast Greedy Triangulation Algorithms.

Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl

Comput. Geom., 1997

Translating a Convex Polygon to Contain a Maximum Number of Points.

Gill Barequet, Matthew T. Dickerson, Petru Pau

Comput. Geom., 1997

Voronoi Diagrams for Polygon-Offset Distance Functions.

Gill Barequet, Matthew Dickerson, Michael T. Goodrich

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Animating the Polygon-Offset Distance Function.

Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

The Rotation Diagram and Optimal Containing Placements of a Convex Polygon.

Matthew Dickerson, Daniel Scharstein

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

A (Usually?) Connected Subgraph of the Minimum Weight Triangulation.

Matthew Dickerson, Mark H. Montague

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Algorithms for Proximity Problems in Higher Dimensions.

Matthew Dickerson, David Eppstein

Comput. Geom., 1995

New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract).

Matthew Dickerson, Scott A. McElfresh, Mark H. Montague

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1993

A Simple Algorithm for Enumerating Longest Distances in the Plane.

Matthew Dickerson, Jason Shugart

Inf. Process. Lett., 1993

General Polynomial Decomposition and the s-1-Decomposition are NP-Hard.

Matthew Dickerson

Int. J. Found. Comput. Sci., 1993

1992

The Inverse of an Automorphism in Polynomial Time.

Matthew Dickerson

J. Symb. Comput., 1992

Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors.

Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack

Int. J. Comput. Geom. Appl., 1992

1991

Enumerating <i>k</i> Distances for <i>n</i> Points in the Plane.

Matthew Dickerson, Robert L. (Scot) Drysdale III

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Fixed-Radius Near Neighbors Search Algorithms for Points and Segments.

Matthew Dickerson, Robert L. (Scot) Drysdale III

Inf. Process. Lett., 1990

1989

The Functional Decomposition of Polynomials.

Matthew T. Dickerson

PhD thesis, 1989