The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matthew Dickerson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gill Barequet, Matthew Dickerson
    The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  2. Matthew Dickerson, Michael T. Goodrich
    Matching points to a convex polygonal boundary. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:89-92 [Conf]
  3. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich
    Animating the Polygon-Offset Distance Function. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:479-480 [Conf]
  4. Gill Barequet, Matthew Dickerson, David Eppstein
    On Triangulating Three-Dimensional Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:38-47 [Conf]
  5. Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin
    2-point site Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:323-324 [Conf]
  6. Matthew Dickerson, Robert L. (Scot) Drysdale III
    Enumerating k Distances for n Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:234-238 [Conf]
  7. Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
    Fast Greedy Triangulation Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:211-220 [Conf]
  8. Matthew Dickerson, Mark H. Montague
    A (Usually?) Connected Subgraph of the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:204-213 [Conf]
  9. Matthew Dickerson, Scott A. McElfresh, Mark H. Montague
    New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:238-247 [Conf]
  10. Matthew Dickerson, Daniel Scharstein
    The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-9 [Conf]
  11. Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
    K-D Trees Are Better when Cut on the Longest Side. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:179-190 [Conf]
  12. Matthew Dickerson
    The Inverse of an Automorphism in Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:82-87 [Conf]
  13. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:1-12 [Conf]
  14. Matthew Dickerson, Daniel Scharstein
    Optimal Placement of Convex Polygons to Maximize Point Containment. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:114-121 [Conf]
  15. Gill Barequet, Prosenjit Bose, Matthew Dickerson
    Optimizing Constrained Offset and Scaled Polygonal Annuli. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:62-73 [Conf]
  16. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
    Offset-Polygon Annulus Placement Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:378-391 [Conf]
  17. Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III
    2-Point Site Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:219-230 [Conf]
  18. Gill Barequet, Matthew Dickerson, Michael T. Goodrich
    Voronoi Diagrams for Polygon-Offset Distance Functions. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:200-209 [Conf]
  19. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
    Offset-polygon annulus placement problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:125-141 [Journal]
  20. Gill Barequet, Matthew Dickerson, David Eppstein
    On triangulating three-dimensional polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:155-170 [Journal]
  21. Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
    Fast Greedy Triangulation Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:67-86 [Journal]
  22. Matthew Dickerson, David Eppstein
    Algorithms for Proximity Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:277-291 [Journal]
  23. Matthew Dickerson, Daniel Scharstein
    Optimal placement of convex polygons to maximize point containment. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:1, pp:1-16 [Journal]
  24. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  25. Gill Barequet, Matthew Dickerson, Michael T. Goodrich
    Voronoi Diagrams for Convex Polygon-Offset Distance Functions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:2, pp:271-291 [Journal]
  26. Matthew Dickerson, J. Mark Keil, Mark H. Montague
    A Large Subgraph of the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:3, pp:289-304 [Journal]
  27. Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack
    Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:221-239 [Journal]
  28. Matthew Dickerson
    General Polynomial Decomposition and the s-1-Decomposition are NP-Hard. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:147-156 [Journal]
  29. Matthew Dickerson, Robert L. (Scot) Drysdale III
    Fixed-Radius Near Neighbors Search Algorithms for Points and Segments. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:5, pp:269-273 [Journal]
  30. Matthew Dickerson, Jason Shugart
    A Simple Algorithm for Enumerating Longest Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:5, pp:269-274 [Journal]
  31. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:1, pp:31-52 [Journal]
  32. Matthew Dickerson
    The Inverse of an Automorphism in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1992, v:13, n:2, pp:209-220 [Journal]

  33. Entropic Force in Drosophila Resilin: Molecular Dynamics Study. [Citation Graph (, )][DBLP]


  34. Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. [Citation Graph (, )][DBLP]


  35. Dilation, smoothed distance, and minimization diagrams of convex functions [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002