Follow
Christian A. Duncan
Christian A. Duncan
Professor of Computer Science, Quinnipiac University
Verified email at acm.org
Title
Cited by
Cited by
Year
On simultaneous planar graph embeddings
P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ...
Computational Geometry 36 (2), 117-130, 2007
162*2007
Optimal constrained graph exploration
CA Duncan, SG Kobourov, VSA Kumar
ACM Transactions on Algorithms (TALG) 2 (3), 380-402, 2006
1482006
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
1202001
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
992004
Lombardi drawings of graphs
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany …, 2011
882011
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
771998
E cient approximation and optimization algorithms for computational metrology
CA Duncan, MT Goodrich, EA Ramos
Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 121-130, 1997
671997
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
642004
Balanced aspect ratio trees and their use for drawing very large graphs
CA Duncan, MT Goodrich, SG Kobourov
Graph Drawing: 6th International Symposium, GD’98 Montréal, Canada, August …, 1998
561998
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
522014
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
492001
Drawing trees with perfect angular resolution and polynomial area
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
Discrete & Computational Geometry 49, 157-182, 2013
472013
Planar Orthogonal and Polyline Drawing Algorithms.
CA Duncan, MT Goodrich
Handbook of Graph Drawing and Visualization, 223-246, 2013
432013
Balanced aspect ratio trees
CA Duncan
The Johns Hopkins University, 2000
422000
Optimal polygonal representation of planar graphs
CA Duncan, ER Gansner, YF Hu, M Kaufmann, SG Kobourov
Algorithmica 63, 672-691, 2012
412012
Drawing planar graphs with circular arcs
CC Cheng, CA Duncan, MT Goodrich, SG Kobourov
Discrete & Computational Geometry 25, 405-418, 2001
412001
Planar and poly-arc Lombardi drawings
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Löffler
Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012
352012
Drawing with fat edges
CA Duncan, A Efrat, SG Kobourov, C Wenk
Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria …, 2002
312002
Drawing planar graphs with circular arcs
CC Cheng, CA Duncan, MT Goodrich, SG Kobourov
Graph Drawing: 7th International Symposium, GD’99 Štiřín Castle, Czech …, 2000
302000
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
291999
The system can't perform the operation now. Try again later.
Articles 1–20