Matthew Dickerson

Matthew T. Dickerson

	2011
48		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)
47		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)
	2010
46		Matthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) 2010: 362-373
45		Matthew Dickerson, David Eppstein, Kevin A. Wortman: Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ISVD 2010: 13-22
44		Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. ISVD 2010: 132-141
43		Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks CoRR abs/1005.1053: (2010)
42		Matthew T. Dickerson, David Eppstein, Michael T. Goodrich: Cloning Voronoi Diagrams via Retroactive Data Structures CoRR abs/1006.1921: (2010)
	2009
41		Roman Petrenko, Matthew Dickerson, Rajesh Naik, Soumya Patnaik, Thomas Beck, Jaroslaw Meller: Entropic Force in Drosophila Resilin: Molecular Dynamics Study. BIOCOMP 2009: 598-603
40		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
39		Matthew T. Dickerson, Michael T. Goodrich: Two-site Voronoi diagrams in geographic networks. GIS 2008: 59
38		Matthew Dickerson, David Eppstein, Kevin A. Wortman: Dilation, smoothed distance, and minimization diagrams of convex functions CoRR abs/0812.0607: (2008)
37		Gill Barequet, Matthew T. Dickerson, Yuval Scharf: Covering points with a polygon. Comput. Geom. 39(3): 143-162 (2008)
	2005
36		Gill Barequet, Yuval Scharf, Matthew T. Dickerson: Covering points with a polygon. Symposium on Computational Geometry 2005: 376-377
35		Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich: Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms 3(1): 1-26 (2005)
34		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)
	2003
33		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
32		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)
31		Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III: 2-Point site Voronoi diagrams. Discrete Applied Mathematics 122(1-3): 37-54 (2002)
	2001
30		Matthew Dickerson, Michael T. Goodrich: Matching points to a convex polygonal boundary. CCCG 2001: 89-92
29		Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin: 2-point site Voronoi diagrams. Symposium on Computational Geometry 2001: 323-324
28		Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discrete & Computational Geometry 25(2): 271-291 (2001)
	2000
27		Gill Barequet, Matthew Dickerson: The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. CCCG 2000
26		Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich: K-D Trees Are Better when Cut on the Longest Side. ESA 2000: 179-190
	1999
25		Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III: 2-Point Site Voronoi Diagrams. WADS 1999: 219-230
24		Gill Barequet, Prosenjit Bose, Matthew Dickerson: Optimizing Constrained Offset and Scaled Polygonal Annuli. WADS 1999: 62-73
	1998
23		Gill Barequet, Matthew Dickerson, David Eppstein: On triangulating three-dimensional polygons. Comput. Geom. 10(3): 155-170 (1998)
22		Matthew Dickerson, Daniel Scharstein: Optimal placement of convex polygons to maximize point containment. Comput. Geom. 11(1): 1-16 (1998)
21		Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-polygon annulus placement problems. Comput. Geom. 11(3-4): 125-141 (1998)
	1997
20		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
19		Gill Barequet, Matthew Dickerson, Michael T. Goodrich: Voronoi Diagrams for Polygon-Offset Distance Functions. WADS 1997: 200-209
18		Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich: Offset-Polygon Annulus Placement Problems. WADS 1997: 378-391
17		Gill Barequet, Matthew T. Dickerson, Petru Pau: Translating a Convex Polygon to Contain a Maximum Number of Points. Comput. Geom. 8: 167-179 (1997)
16		Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997)
15		Matthew Dickerson, J. Mark Keil, Mark H. Montague: A Large Subgraph of the Minimum Weight Triangulation. Discrete & Computational Geometry 18(3): 289-304 (1997)
	1996
14		Matthew Dickerson, Daniel Scharstein: Optimal Placement of Convex Polygons to Maximize Point Containment. SODA 1996: 114-121
13		Matthew Dickerson, Mark H. Montague: A (Usually?) Connected Subgraph of the Minimum Weight Triangulation. Symposium on Computational Geometry 1996: 204-213
12		Gill Barequet, Matthew Dickerson, David Eppstein: On Triangulating Three-Dimensional Polygons. Symposium on Computational Geometry 1996: 38-47
11		Matthew Dickerson, Daniel Scharstein: The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. Symposium on Computational Geometry 1996: V-9-V-10
	1995
10		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
9		Matthew Dickerson, David Eppstein: Algorithms for Proximity Problems in Higher Dimensions. Comput. Geom. 5: 277-291 (1995)
	1994
8		Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Symposium on Computational Geometry 1994: 211-220
	1993
7		Matthew Dickerson, Jason Shugart: A Simple Algorithm for Enumerating Longest Distances in the Plane. Inf. Process. Lett. 45(5): 269-274 (1993)
6		Matthew Dickerson: General Polynomial Decomposition and the s-1-Decomposition are NP-Hard. Int. J. Found. Comput. Sci. 4(2): 147-156 (1993)
	1992
5		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)
4		Matthew Dickerson: The Inverse of an Automorphism in Polynomial Time. J. Symb. Comput. 13(2): 209-220 (1992)
	1991
3		Matthew Dickerson, Robert L. (Scot) Drysdale III: Enumerating k Distances for n Points in the Plane. Symposium on Computational Geometry 1991: 234-238
	1990
2		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
1		Matthew Dickerson: The Inverse of an Automorphism in Polynomial Time FOCS 1989: 82-87

Coauthor Index

1	Gill Barequet	[12] [17] [18] [19] [20] [21] [23] [24] [25] [27] [28] [29] [31] [35] [36] [37] [48]
2	Thomas Beck	[41]
3	Prosenjit Bose	[24] [35]
4	Amy J. Briggs	[18] [20] [21]
5	Thomas D. Dickerson	[43] [44] [47]
6	Cristian Dima	[20]
7	Robert L. Scot Drysdale (Robert L. (Scot) Drysdale III)	[2] [3] [5] [8] [16] [25] [29] [31]
8	Christian A. Duncan	[26]
9	David Eppstein	[9] [12] [23] [32] [33] [34] [38] [40] [42] [45] [46] [48]
10	Michael T. Goodrich	[18] [19] [20] [21] [26] [28] [30] [32] [33] [34] [35] [39] [42] [43] [44] [46] [47]
11	David S. Guertin	[29]
12	David Hodorkovsky	[48]
13	J. Mark Keil	[15]
14	Scott A. McElfresh	[8] [10] [16]
15	Jaroslaw Meller	[41]
16	Jeremy Yu Meng	[32] [33] [34]
17	Mark H. Montague	[10] [13] [15]
18	Rajesh Naik	[41]
19	Soumya Patnaik	[41]
20	Petru Pau	[17]
21	Roman Petrenko	[41]
22	Jörg-Rüdiger Sack	[5]
23	Yuval Scharf	[36] [37]
24	Daniel Scharstein	[11] [14] [22]
25	Jason Shugart	[7]
26	Kira Vyatkina	[48]
27	Emo Welzl	[8] [16]
28	Kevin A. Wortman	[38] [45]
29	Ying Daisy Zhuo	[47]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page