Research
Graph Drawing
Computational Geometry
Algorithm Analysis
Security
Planar Graphs
Different Sizes
Wu Rzburg
Position Data
Real Time Classification
Wireless Sensor Networks, Wireless Sensor Network
Curricular Development
Systemic Change
Computational Metrology
Optimization Algorithms, Optimization Algorithm
Parallel Algorithms
List of Publications (74)
In 2019
74
Classifying unordered feature sets with convolutional deep averaging networks. A Gardner, N Elhami, RR Selmic 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC ..., 2019.
Found on Publication Page
In 2018
73
Approximate geometric query structures. CA Duncan, MT Goodrich Handbook of Data Structures and Applications, 405-417, 2018.
Found on Publication Page
In 2017
72
Estimating the distribution of unlabeled, correlated point sets. A Gardner, CA Duncan, J Kanno, RR Selmic 2017 IEEE 56th Annual Conference on Decision and Control (CDC), 1554-1559, 2017.
Found on Publication Page
71
On the definiteness of earth mover's distance and its relation to set intersection. A Gardner, CA Duncan, J Kanno, RR Selmic IEEE transactions on cybernetics 48 (11), 3184-3196, 2017.
Found on Publication Page
In 2015
70
Maximizing the Degree of (Geometric) Thickness-t Regular Graphs. CA Duncan International Symposium on Graph Drawing, 199-204, 2015.
Found on Publication Page
69
Earth mover's distance yields positive definite kernels for certain ground distances. A Gardner, CA Duncan, J Kanno, RR Selmic arXiv preprint arXiv 1510, 2, 2015.
Found on Publication Page
In 2014
68
Graph Drawing: 22nd International Symposium, GD 2014, Wu rzburg, Germany, September 24-26, 2014, Revised Selected Papers. C Duncan, A Symvonis Springer, 2014.
Found on Publication Page
67
Unmanned ground vehicle navigation in coordinate-free and localization-free wireless sensor and actuator networks. G Zhang, CA Duncan, J Kanno, RR Selmic Journal of Intelligent & Robotic Systems 74, 869-891, 2014.
Found on Publication Page
66
Measuring distance between unordered sets of different sizes. A Gardner, J Kanno, CA Duncan, R Selmic Proceedings of the IEEE conference on computer vision and pattern ..., 2014.
Found on Publication Page
65
3d hand posture recognition from small unlabeled point sets. A Gardner, CA Duncan, J Kanno, R Selmic 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC ..., 2014.
Found on Publication Page
64
Revised Selected Papers of the 22nd International Symposium on Graph Drawing-Volume 8871. C Duncan, A Symvonis Springer-Verlag, 2014.
Found on Publication Page
In 2013
63
Drawing trees with perfect angular resolution and polynomial area. CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M No llenburg Discrete & Computational Geometry 49, 157-182, 2013.
Found on Publication Page
62
Planar Orthogonal and Polyline Drawing Algorithms. CA Duncan, MT Goodrich Handbook of Graph Drawing and Visualization, 223-246, 2013.
Found on Publication Page
61
Multi-UGV multi-destination navigation in coordinate-free and localization-free wireless sensor and actuator networks. G Zhang, RR Selmic, CA Duncan, J Kanno 52nd IEEE Conference on Decision and Control, 4134-4139, 2013.
Found on Publication Page
60
Real-time classification of dynamic hand gestures from marker-based position data. A Gardner, CA Duncan, R Selmic, J Kanno Proceedings of the companion publication of the 2013 international ..., 2013.
Found on Publication Page
In 2012
59
Optimal polygonal representation of planar graphs. CA Duncan, ER Gansner, YF Hu, M Kaufmann, SG Kobourov Algorithmica 63, 672-691, 2012.
Found on Publication Page
58
Planar and poly-arc Lombardi drawings. CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Lo ffler Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The ..., 2012.
Found on Publication Page
57
Lombardi drawings of graphs. C Duncan, D Eppstein, M Goodrich, S Kobourov, M No llenburg Journal of Graph Algorithms and Applications 16 (1), 85-108, 2012.
Found on Publication Page
56
Graph drawing contest report. CA Duncan, C Gutwenger, L Nachmanson, G Sander Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The ..., 2012.
Found on Publication Page
55
UGV navigation in wireless sensor and actuator network environments. G Zhang, J Li, CA Duncan, J Kanno, RR Selmic Unmanned Systems Technology XIV 8387, 176-186, 2012.
Found on Publication Page
In 2011
54
On the complexity of aggregating information for authentication and profiling. CA Duncan, VV Phoha International Workshop on Data Privacy Management, 58-71, 2011.
Found on Publication Page
53
Planar drawings of higher-genus graphs. CA Duncan, MT Goodrich, SG Kobourov Journal of Graph Algorithms and Applications 15 (1), 7-32, 2011.
Found on Publication Page
52
On graph thickness, geometric thickness, and separator theorems. CA Duncan Computational Geometry 44 (2), 95-99, 2011.
Found on Publication Page
51
Distributed unmanned ground vehicle navigation in coordinate-free and localization-free wireless sensor and actuator networks. G Zhang, CA Duncan, J Kanno, RR Selmic 2011 50th IEEE Conference on Decision and Control and European Control ..., 2011.
Found on Publication Page
In 2010
50
Studies in cyberspace: honors, professional teacher development, curricular development, and systemic change in Louisiana. BC Etheridge, G Turner, H Tims, CA Duncan .
Found on Publication Page
49
Unmanned ground vehicle navigation in coordinate-free and localization-free Wireless Sensor and Acutuator Networks. G Zhang, C Duncan, J Kanno, R Selmic 2010 IEEE International Conference on Control Applications, 428-433, 2010.
Found on Publication Page
In 2009
48
Work in progress-Cyber Discovery camp-Integrated approach to cyber studies. H Tims, G Turner, C Duncan, B Etheridge 2009 39th IEEE Frontiers in Education Conference, 1-2, 2009.
Found on Publication Page
47
Detecting (approximate) hole coverage areas in wireless sensor networks. CA Duncan, J Kanno, R Selmic 2nd Cyberspace Research Workshop, 29, 2009.
Found on Publication Page
In 2008
46
Graph drawing contest report. U Dogrusoz, CA Duncan, C Gutwenger, G Sander International Symposium on Graph Drawing, 453-458, 2008.
Found on Publication Page
In 2007
45
Graph drawing contest report. CA Duncan, SG Kobourov, G Sander International Symposium on Graph Drawing, 395-400, 2007.
Found on Publication Page
44
On simultaneous planar graph embeddings. P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ... Computational Geometry 36 (2), 117-130, 2007.
Found on Publication Page
In 2006
43
Optimal constrained graph exploration. CA Duncan, SG Kobourov, VSA Kumar ACM Transactions on Algorithms (TALG) 2 (3), 380-402, 2006.
Found on Publication Page
42
Drawing with fat edges. CA Duncan, A Efrat, S Kobourov, C Wenk International Journal of Foundations of Computer Science 17 (05), 1143-1163, 2006.
Found on Publication Page
In 2004
41
Tight bounds on maximal and maximum matchings. T Biedl, ED Demaine, CA Duncan, R Fleischer, SG Kobourov Discrete Mathematics 285 (1-3), 7-15, 2004.
Found on Publication Page
40
The geometric thickness of low degree graphs. CA Duncan, D Eppstein, SG Kobourov Proceedings of the twentieth annual symposium on Computational geometry, 340-346, 2004.
Found on Publication Page
39
Balanced aspect ratio trees and their use for drawing large graphs. CA Duncan, MT Goodrich, SG Kobourov Graph Algorithms And Applications 2, 53-80, 2004.
Found on Publication Page
In 2003
38
Polar coordinate drawing of planar graphs with good angular resolution. C Duncan, S Kobourov Journal of Graph Algorithms and Applications 7 (4), 311-333, 2003.
Found on Publication Page
37
Multi-way space partitioning trees. CA Duncan Workshop on Algorithms and Data Structures, 219-230, 2003.
Found on Publication Page
36
Planarity-preserving clustering and embedding for large planar graphs. CA Duncan, MT Goodrich, SG Kobourov Computational Geometry 24 (2), 95-114, 2003.
Found on Publication Page
In 2002
35
On Simultaneous Graph Embedding. CA Duncan, A Efrat, C Erten, S Kobourov, JSB Mitchell arXiv preprint cs/0206018, 2002.
Found on Publication Page
34
Drawing with fat edges. CA Duncan, A Efrat, SG Kobourov, C Wenk Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria ..., 2002.
Found on Publication Page
In 2001
33
Barequet, Gill, 91 Biedl, Therese C., 110 Bose, Prosenjit, 110. D Bryant, B Chandra, E Cohen, LJ Cowen, ED Demaine, CA Duncan, ... Journal of Algorithms 38, 467, 2001.
Found on Publication Page
32
Drawing planar graphs with circular arcs. CC Cheng, CA Duncan, MT Goodrich, SG Kobourov Discrete & Computational Geometry 25, 405-418, 2001.
Found on Publication Page
31
Tight bounds on maximal and maximum matchings. T Biedl, ED Demaine, CA Duncan, R Fleischer, SG Kobourov Algorithms and Computation: 12th International Symposium, ISAAC 2001 ..., 2001.
Found on Publication Page
30
Balanced aspect ratio trees: Combining the advantages of kd trees and octrees. CA Duncan, MT Goodrich, S Kobourov Journal of Algorithms 38 (1), 303-333, 2001.
Found on Publication Page
29
Efficient perspective-accurate silhouette computation and applications. M Pop, C Duncan, G Barequet, M Goodrich, W Huang, S Kumar Proceedings of the seventeenth annual symposium on Computational geometry, 60-68, 2001.
Found on Publication Page
In 2000
28
Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, and Anna Lubiw. Effi. D Bryant, M Steel, LJ Cowen, CA Duncan, MT Goodrich, S Kobourov, ... Journal of Algorithms 37, 578, 2000.
Found on Publication Page
27
KD trees are better when cut on the longest side. M Dickerson, CA Duncan, MT Goodrich Algorithms-ESA 2000: 8th Annual European Symposium Saarbru cken, Germany ..., 2000.
Found on Publication Page
26
On the flattest common supersequence method for deadlock-free routing in arbitrary networks. AK Laing, R Cypher, CA Duncan Theory of Computing Systems 33, 393-426, 2000.
Found on Publication Page
In 1999
24
Drawing planar graphs with circular arcs. CC Cheng, CA Duncan, MT Goodrich, SG Kobourov International Symposium on Graph Drawing, 117-126, 1999.
Found on Publication Page
23
Planarity-preserving clustering and embedding for large planar graphs. CA Duncan, MT Goodrich, SG Kobourov International Symposium on Graph Drawing, 186-196, 1999.
Found on Publication Page
22
Efficient perspective-accurate silhouette computation. G Barequet, CA Duncan, MT Goodrich, S Kumar, M Pop Proceedings of the fifteenth annual symposium on Computational geometry, 417-418, 1999.
Found on Publication Page
21
GeomNet: Geometric computing over the Internet. G Barequet, CA Duncan, MT Goodrich, SS Bridgeman, R Tamassia IEEE Internet Computing 3 (2), 21-29, 1999.
Found on Publication Page
In 1998
20
Balanced Aspect Ratio Trees: An Introduction. CA Duncan, MT Goodrich, SG Kobourov 3rd CGC Workshop on Computational Geometry, Providence, 1998.
Found on Publication Page
19
Balanced aspect ratio trees and their use for drawing very large graphs. CA Duncan, MT Goodrich, SG Kobourov International Symposium on Graph Drawing, 111-124, 1998.
Found on Publication Page
18
RSVP: A geometric toolkit for controlled repair of solid models. G Barequet, CA Duncan, S Kumar IEEE Transactions on Visualization and Computer Graphics 4 (2), 162-177, 1998.
Found on Publication Page
In 1997
17
Efficient approximation and optimization algorithms for computational metrology. CA Duncan, MT Goodrich, EA Ramos Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 121-130, 1997.
Found on Publication Page
16
Classical computational geometry in GeomNet. G Barequet, SS Bridgeman, CA Duncan, MT Goodrich, R Tamassia Proceedings of the thirteenth annual symposium on Computational geometry ..., 1997.
Found on Publication Page
In 1994
15
Proceedings of the 4th ACM symposium on Parallel algorithms and architectures. AL Rosenberg Springer-Verlag, 1994.
Found on Publication Page
Unspecified
14
Multi-destination, multi-ugv navigation planning in coordinate-free and localization-free wireless sensor and actuator networks. G Zhang, CA Duncan, J Kanno, RR Selmic submitted to IEEE CDC (February 2012), 0.
Found on Publication Page
12
Special Issue of Selected Papers from the 22nd International Symposium on Graph Drawing (GD 2014) Guest Editors' Foreword. CA Duncan, A Symvonis .
Found on Publication Page
11
Papers Program Committee. D Archambault, F Beck, R Borgo, M Brehmer, M Chen, W Chen, J Choo, ... .
Found on Publication Page
10
AGARWAL, PK, GUIBAS, LJ, HERSHBERGER, J., and VEACH, E.: Maintaining the Extent of a Moving Point Set BARANY, I., and MATOUSEK, J.: Simultaneous Partitions of Measures by k .... K BOROCZKY, FPP Set, CC CHENG, CA DUNCAN, MT GOODRICH, ... .
Found on Publication Page
8
Visualization Notes Committee. D Archambault, R Borgo, W Chen, Y Chen, W Cui, C Duncan, T Ertl, Y Hu, ... .
Found on Publication Page
6
On Simultaneous Planar Graph Embeddings P. Brassi, E. Cenek2, CA Duncan3, A. Efrat* 4, C. Erten* 4, D. Ismailescu5, SG Kobourov* 4, A. Lubiw2, and JSB Mitchell** 6 1 Dept. of .... P Brassi, E Cenek, CA Duncan .
Found on Publication Page
5
Center for Geometric Computing The Johns Hopkins University. CA Duncan, MT Goodrich, SG Kobourov .
Found on Publication Page
3
4.5 Edge Bundling. D Auber, S Diehl, C Duncan, C Erten, R Fleischer, E Gansner, ... Graph Drawing with Algorithm Engineering Methods, 56, 0.
Found on Publication Page
2
Tight Bounds on Maximal and Maximum Matchings Therese Biedl1, Erik D. Demaine1, Christian A. Duncan2, Rudolf Fleischer3, and Stephen G. Kobourov4 f Department of Computer .... T Biedl, ED Demaine, CA Duncan, R Fleischer, SG Kobourov .
Found on Publication Page
