Christian Duncan's List of Publications

Thesis Publication

• C. A. Duncan, Balanced Aspect Ratio Trees (gzipped), Dissertation for the Doctor of Philosophy degree, Department of Computer Science, The Johns Hopkins University, September 1999.
  Readers: Michael T. Goodrich and S. Rao Kosaraju
  

Journal Publications

1. P. Brass, E. Cenek, C. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. Kobourov, A. Lubiw, and J. Mitchell, On Simultaneous Planar Graph Embeddings, Computational Geometry: Theory and Applications, 36(2):117-130, 2007.
   (A preliminary version appeared in LNCS 2748: Algorithms and Data Structures, 8th International Workshop (WADS 2003), , pp. 243-255 (2003).)
   
2. C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk, Drawing with Fat Edges, IJFCS: International Journal of Foundations of Computer Science, 17(5):1143-1163, 2006.
   (A preliminary version appeared in LNCS 2265: Graph Drawing, 9th International Symposium (GD 2001), , pp. 162-177 (2002).)
   
3. C. Duncan, S. Kobourov, and V. S. A. Kumar, Optimal Constrained Graph Exploration, ACM Transactions on Algorithms, 3(2):380-402, 2006.
   (A preliminary version appeared in 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 807-814 (2001).)
   
4. T. Biedl and E. Demaine and C. Duncan and R. Fleischer and S. Kobourov, Tight Bounds on Maximal and Maximum Matchings, Discrete Mathematics 285(1-3):7-15, 2004.
   (A preliminary version appeared in LNCS 2223: Algorithms and Computation: Proceedings of the 12th International Symposium, ISAAC 2001), pp. 308-319 (2001).)
   
5. C. A. Duncan and S. G. Kobourov, Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution, Journal of Graph Algorithms and Applications (JGAA) 7(4):311-333, 2003.
   (A preliminary version appeared in LNCS 2265: Graph Drawing, 9th International Symposium (GD 2001), , pp. 407-421.)
   
6. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Planarity-Preserving Clustering and Embedding for Large Planar Graphs, CGTA: Computational Geometry: Theory and Applications 24(2):95-114, 2003.
   (A preliminary version appeared in Proceedings of the Seventh Symposium on Graph Drawing, pp. 186-196, 1999).
   
7. C.C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Drawing Planar Graphs with Circular Arcs, Discrete & Computational Geometry 25: 405-418, 2001.
   (A preliminary version appeared in Proceedings of the Seventh Symposium on Graph Drawing, pp. 117-126, 1999).
8. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees, Journal of Algorithms 38:303-333, 2001).
   
9. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs, Journal of Graph Algorithms and Applications, Special Volume on Graph Drawing 1998 4:19-46, 2000.
   (A preliminary version appeared in Proceedings of the Sixth Symposium on Graph Drawing, pp. 111-124, 1998).
   
10. A.K. Laing, R. Cypher, and C. A. Duncan, On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks, Theory of Computing Systems 33:393-426, 2000.
    
11. G. Barequet, S. Bridgeman, C. A. Duncan, M. T. Goodrich, and R. Tamassia, GeomNet: Geometric Computing Over the Internet, IEEE Internet Computing 3(2), pp. 21-29, April 1999.
    
12. G. Barequet, C. A. Duncan, and S. Kumar, RSVP: A Geometric Toolkit for Controlled Repair of Solid Models (compressed), IEEE Transactions on Visualization and Computer Graphics 4(2):162-177, April 1998.
    

Conference Publications

1. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Planar Drawings of Higher-Genus Graphs, Proceedings of the 17th International Symposium on Graph Drawing (GD 2009), to appear.
2. C. A. Duncan, On Graph Thickness, Geometric Thickness, and Separator Theorems, Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG 2009), to appear.
3. C. A. Duncan, D. Eppstein, and S. G. Kobourov, The Geometric Thickness of Low Degree Graphs, Proceedings of the 20th Annual Symposium on Computational Geometry (SCG) pp. 340-346 (2004).
   
4. P. Brass, E. Cenek, C. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. Kobourov, A. Lubiw, and J. Mitchell, On Simultaneous Planar Graph Embeddings, LNCS 2748: Algorithms and Data Structures, 8th International Workshop (WADS 2003), , pp. 243-255 (2003).
   
5. C. Duncan, Multi-way Space Partitioning Trees, LNCS 2748: Algorithms and Data Structures, 8th International Workshop (WADS 2003), , pp. 219-230 (2003).
   
6. C. Duncan and S. Kobourov, Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution, LNCS 2265: Graph Drawing, 9th International Symposium (GD 2001), , pp. 407-421 (2002).
   
7. C. Duncan, A. Efrat, S. Kobourov, and C. Wenk, Drawing Graphs with Fat Edges, LNCS 2265: Graph Drawing, 9th International Symposium (GD 2001), , pp. 162-177 (2002).
   
8. T. Biedl, E. Demaine, C. Duncan, R. Fleischer, and S. Kobourov, Tight Bounds on Maximal and Maximum Matchings, LNCS 2223: Algorithms and Computation: Proceedings of the 12th International Symposium, ISAAC 2001, pp. 308-319 (2001).
   
9. M. Pop, G. Barequet, C.A. Duncan, M.T. Goodrich, W. Huang, and S. Kumar, Efficient Perspective-accurate Silhouette Computation, Proceedings of the 17th Annual International Symposium on Computational Geometry (SCG), pp. 60-68 (2001).
   
10. C. Duncan, S. Kobourov, and A. Kumar, Optimal Constrained Graph Exploration, 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 807-814 (2001).
    
11. M. Dickerson, C. Duncan, and M. Goodrich, K-D Trees Are Better when Cut on the Longest Side, LNCS 1879: Algorithms- ESA 2000, pp. 179-190 (2000).
    
12. C.C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Drawing Planar Graphs with Circular Arcs, Proceedings of the Seventh Symposium on Graph Drawing, pp. 117-126 (1999).
    
13. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Planarity-Preserving Clustering and Embedding for Large Planar Graphs, Proceedings of the Seventh Symposium on Graph Drawing, pp. 186-196 (1999).
    
14. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees (compressed), 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 300-309 (1999).
    
15. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs (compressed), Proceedings of the Sixth Symposium on Graph Drawing, pp. 111-124 (1998).
    
16. G. Barequet, S. Bridgeman, C. Duncan, M. Goodrich, and R. Tamassia, Classical Computational Geometry in GeomNet (compressed) (pdf), Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG), pp. 412-414 (1997).
    
17. C. A. Duncan, M. T. Goodrich, and E. A. Ramos, Efficient Approximation and Optimization Algorithms for Computational Metrology (compressed), 8th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 121-130 (1997).
    Here is the current width code. It is very very preliminary. No commenting... uses other code etc. Use at your own risk and enjoyment :-) Maybe someday (soon?) I'll get back to making a much nicer coded work.

Book Chapters

1. C. A. Duncan and M. T. Goodrich, "Approximate Geometric Query Structures," in Handbook of Data Structures and Applications (edited by D. P. Mehta and S. Sahni), Chapman & Hall/CRC Computer & Information Science Series, Volume 4, CRC Press, 2004, pp. 26-1-26-17.
   

Video Publications

1. G. Barequet, C. A. Duncan, M. T. Goodrich, S. Kumar, and M. Pop, Efficient Perspective-Accurate Silhouette Computation, 8th Annual Video Review of Computational Geometry (SCG '99), p. 417 (1999).