M. Dickerson

发表

Two-Site Voronoi Diagrams under Geometric Distance Functions

D. Eppstein, G. Barequet, K. Vyatkina, 2011 .

The Functional Decomposition of Polynomials

M. Dickerson, Matthew Thomas Dickerson, 1989 .

SERIE B INFORMATIK Fast Greedy Triangulation Algorithms

Scott A. McElfresh, E. Welzl, R. Drysdale, 2009 .

Polynomial Decomposition Algorithms For Multivariate Polynomials

Matthew T. Dickerson, M. Dickerson, 1987 .

On 2-Site Voronoi Diagrams Under Geometric Distance Functions

David Eppstein, Gill Barequet, Matthew Dickerson, 2011, Journal of Computer Science and Technology.

Voronoi diagrams for convex polygon-offset distance functions

Michael T. Goodrich, Gill Barequet, Matthew Dickerson, 2001, Discret. Comput. Geom..

Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks

Michael T. Goodrich, Matthew Dickerson, Ying Daisy Zhuo, 2010, 2010 International Symposium on Voronoi Diagrams in Science and Engineering.

Two-site Voronoi diagrams in geographic networks

Michael T. Goodrich, Matthew Dickerson, M. Goodrich, 2008, GIS '08.

Offset-polygon annulus placement problems

Michael T. Goodrich, Gill Barequet, Matthew Dickerson, 1997, Comput. Geom..

Using simulation across the curriculum

Ingrid Russell, Matthew Dickerson, Timothy Huang, 2000 .

Cloning Voronoi Diagrams via Retroactive Data Structures pdf

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

Translating a Convex Polygon to Contain a Maximum Number of Points

Gill Barequet, Matthew Dickerson, Petru Pau, 1997, Comput. Geom..

Optimal placement of convex polygons to maximize point containment

Matthew Dickerson, Daniel Scharstein, M. Dickerson, 1996, SODA '96.

Fixed-Radius Near Neighbors Search Algorithms for Points and Segments

Matthew Dickerson, Robert L. Scot Drysdale, R. Drysdale, 1990, Inf. Process. Lett..

Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

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

Fast greedy triangulation algorithms

Emo Welzl, Matthew Dickerson, Robert L. Scot Drysdale, 1994, SCG '94.

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

Matthew Dickerson, Robert L. Scot Drysdale, Jörg-Rüdiger Sack, 1992, Int. J. Comput. Geom. Appl..

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

David Eppstein, Matthew Dickerson, Kevin A. Wortman, 2010, 2010 International Symposium on Voronoi Diagrams in Science and Engineering.

Dilation, smoothed distance, and minimization diagrams of convex functions pdf

David Eppstein, Matthew Dickerson, Kevin A. Wortman, 2008, ArXiv.

Voronoi Diagrams for Polygon-Offset Distance Functions

Michael T. Goodrich, Gill Barequet, Matthew Dickerson, 1997, WADS.

Enumerating k distances for n points in the plane

Matthew Dickerson, Robert L. Scot Drysdale, R. Drysdale, 1991, SCG '91.

On triangulating three-dimensional polygons

David Eppstein, Gill Barequet, Matthew Dickerson, 1996, SCG '96.

Algorithms for Proximity Problems in Higher Dimensions

David Eppstein, Matthew Dickerson, D. Eppstein, 1995, Comput. Geom..

The inverse of an automorphism in polynomial time

Matthew Dickerson, M. Dickerson, 1989, 30th Annual Symposium on Foundations of Computer Science.

Optimizing a constrained convex polygonal annulus

Prosenjit Bose, Michael T. Goodrich, Gill Barequet, 2005, J. Discrete Algorithms.

Using Memory Dumps in Digital Forensics

Matthew Dickerson, Sam Stover, S. Stover, 2005, Login: The Usenix Magazine.

A (usually?) connected subgraph of the minimum weight triangulation

Matthew Dickerson, Mark H. Montague, M. Dickerson, 1996, SCG '96.

2-point site Voronoi diagrams

Gill Barequet, Matthew Dickerson, Robert L. Scot Drysdale, 1999, SCG '01.