Matthew Dickerson

Matthew T. Dickerson

	2013
j19		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): 267-277 (2013)
	2011
j18		Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson, Ying Daisy Zhuo: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. Transactions on Computational Science 14: 211-238 (2011)
c26		Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina: On 2-Site Voronoi Diagrams under Geometric Distance Functions. ISVD 2011: 31-38
i5		Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina: On 2-Site Voronoi Diagrams under Geometric Distance Functions. CoRR abs/1105.4130 (2011)
	2010
c25		Matthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) 2010: 362-373
c24		Matthew Dickerson, David Eppstein, Kevin A. Wortman: Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ISVD 2010: 13-22
c23		Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. ISVD 2010: 132-141
i4		Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. CoRR abs/1005.1053 (2010)
i3		Matthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures. CoRR abs/1006.1921 (2010)
	2009
c22		Roman Petrenko, Matthew Dickerson, Rajesh Naik, Soumya Patnaik, Thomas Beck, Jaroslaw Meller: Entropic Force in Drosophila Resilin: Molecular Dynamics Study. BIOCOMP 2009: 598-603
c21		Matthew T. Dickerson, David Eppstein: Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). Symposium on Computational Geometry 2009: 92-93
	2008
j17		Gill Barequet, Matthew T. Dickerson, Yuval Scharf: Covering points with a polygon. Comput. Geom. 39(3): 143-162 (2008)
c20		Matthew T. Dickerson, Michael T. Goodrich: Two-site Voronoi diagrams in geographic networks. GIS 2008: 59
i2		Matthew Dickerson, David Eppstein, Kevin A. Wortman: Dilation, smoothed distance, and minimization diagrams of convex functions. CoRR abs/0812.0607 (2008)
	2005
j16		Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich: Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms 3(1): 1-26 (2005)
j15		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): 31-52 (2005)
c19		Gill Barequet, Yuval Scharf, Matthew T. Dickerson: Covering points with a polygon. Symposium on Computational Geometry 2005: 376-377
	2003
c18		Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Graph Drawing 2003: 1-12
	2002
j14		Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III: 2-Point site Voronoi diagrams. Discrete Applied Mathematics 122(1-3): 37-54 (2002)
i1		Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. CoRR cs.CG/0212046 (2002)
	2001
j13		Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discrete & Computational Geometry 25(2): 271-291 (2001)
c17		Matthew Dickerson, Michael T. Goodrich: Matching points to a convex polygonal boundary. CCCG 2001: 89-92
c16		Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin: 2-point site Voronoi diagrams. Symposium on Computational Geometry 2001: 323-324
	2000
c15		Gill Barequet, Matthew Dickerson: The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. CCCG 2000
c14		Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich: K-D Trees Are Better when Cut on the Longest Side. ESA 2000: 179-190
	1999
c13		Gill Barequet, Prosenjit Bose, Matthew Dickerson: Optimizing Constrained Offset and Scaled Polygonal Annuli. WADS 1999: 62-73
c12		Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III: 2-Point Site Voronoi Diagrams. WADS 1999: 219-230
	1998
j12		Gill Barequet, Matthew Dickerson, David Eppstein: On triangulating three-dimensional polygons. Comput. Geom. 10(3): 155-170 (1998)
j11		Matthew Dickerson, Daniel Scharstein: Optimal placement of convex polygons to maximize point containment. Comput. Geom. 11(1): 1-16 (1998)
j10		Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-polygon annulus placement problems. Comput. Geom. 11(3-4): 125-141 (1998)
	1997
j9		Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997)
j8		Gill Barequet, Matthew T. Dickerson, Petru Pau: Translating a Convex Polygon to Contain a Maximum Number of Points. Comput. Geom. 8: 167-179 (1997)
j7		Matthew Dickerson, J. Mark Keil, Mark H. Montague: A Large Subgraph of the Minimum Weight Triangulation. Discrete & Computational Geometry 18(3): 289-304 (1997)
c11		Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich: Animating the Polygon-Offset Distance Function. Symposium on Computational Geometry 1997: 479-480
c10		Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Polygon-Offset Distance Functions. WADS 1997: 200-209
c9		Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-Polygon Annulus Placement Problems. WADS 1997: 378-391
	1996
c8		Gill Barequet, Matthew Dickerson, David Eppstein: On Triangulating Three-Dimensional Polygons. Symposium on Computational Geometry 1996: 38-47
c7		Matthew Dickerson, Mark H. Montague: A (Usually?) Connected Subgraph of the Minimum Weight Triangulation. Symposium on Computational Geometry 1996: 204-213
c6		Matthew Dickerson, Daniel Scharstein: The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. Symposium on Computational Geometry 1996: V-9-V-10
c5		Matthew Dickerson, Daniel Scharstein: Optimal Placement of Convex Polygons to Maximize Point Containment. SODA 1996: 114-121
	1995
j6		Matthew Dickerson, David Eppstein: Algorithms for Proximity Problems in Higher Dimensions. Comput. Geom. 5: 277-291 (1995)
c4		Matthew Dickerson, Scott A. McElfresh, Mark H. Montague: New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract). Symposium on Computational Geometry 1995: 238-247
	1994
c3		Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Symposium on Computational Geometry 1994: 211-220
	1993
j5		Matthew Dickerson: General Polynomial Decomposition and the s-1-Decomposition are NP-Hard. Int. J. Found. Comput. Sci. 4(2): 147-156 (1993)
j4		Matthew Dickerson, Jason Shugart: A Simple Algorithm for Enumerating Longest Distances in the Plane. Inf. Process. Lett. 45(5): 269-274 (1993)
	1992
j3		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. Geometry Appl. 2(3): 221-239 (1992)
j2		Matthew Dickerson: The Inverse of an Automorphism in Polynomial Time. J. Symb. Comput. 13(2): 209-220 (1992)
	1991
c2		Matthew Dickerson, Robert L. (Scot) Drysdale III: Enumerating k Distances for n Points in the Plane. Symposium on Computational Geometry 1991: 234-238
	1990
j1		Matthew Dickerson, Robert L. (Scot) Drysdale III: Fixed-Radius Near Neighbors Search Algorithms for Points and Segments. Inf. Process. Lett. 35(5): 269-273 (1990)
	1989
c1		Matthew Dickerson: The Inverse of an Automorphism in Polynomial Time. FOCS 1989: 82-87

Coauthor Index

Colors in the list of coauthors

Last update Wed May 22 05:18:51 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page