|
Search the dblp DataBase
Matthew T. Dickerson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Gill Barequet, Yuval Scharf, Matthew T. Dickerson
Covering points with a polygon. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:376-377 [Conf]
- Gill Barequet, Matthew T. Dickerson, Petru Pau
Translating a Convex Polygon to Contain a Maximum Number of Points. [Citation Graph (0, 0)][DBLP] Comput. Geom., 1997, v:8, n:, pp:167-179 [Journal]
- Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III
2-Point site Voronoi diagrams. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:37-54 [Journal]
- Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich
Optimizing a constrained convex polygonal annulus. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2005, v:3, n:1, pp:1-26 [Journal]
Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). [Citation Graph (, )][DBLP]
Cloning Voronoi Diagrams via Retroactive Data Structures. [Citation Graph (, )][DBLP]
Two-site Voronoi diagrams in geographic networks. [Citation Graph (, )][DBLP]
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. [Citation Graph (, )][DBLP]
Covering points with a polygon. [Citation Graph (, )][DBLP]
Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks [Citation Graph (, )][DBLP]
Cloning Voronoi Diagrams via Retroactive Data Structures [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|