Christian A. Duncan
Christian A. Duncan
Professor of Computer Science, Quinnipiac University
Verified email at
Cited by
Cited by
On simultaneous planar graph embeddings
P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ...
Computational Geometry 36 (2), 117-130, 2007
The increase of metopic synostosis: a pan-European observation
J van der Meulen, R van der Hulst, L van Adrichem, E Arnaud, ...
Journal of Craniofacial Surgery 20 (2), 283-286, 2009
Optimal constrained graph exploration
CA Duncan, SG Kobourov, VSA Kumar
ACM Transactions on Algorithms (TALG) 2 (3), 380-402, 2006
A 3d morphable model of craniofacial shape and texture variation
H Dai, N Pears, WAP Smith, C Duncan
Proceedings of the IEEE international conference on computer vision, 3085-3093, 2017
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
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
Lombardi Drawings of Graphs.
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
J. Graph Algorithms Appl. 16 (1), 85-108, 2012
Statistical modeling of craniofacial shape and texture
H Dai, N Pears, W Smith, C Duncan
International Journal of Computer Vision 128, 547-571, 2020
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
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
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
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
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
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
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
Planar Orthogonal and Polyline Drawing Algorithms.
CA Duncan, MT Goodrich
Handbook of Graph Drawing and Visualization, 223-246, 2013
Drawing planar graphs with circular arcs
CC Cheng, CA Duncan, MT Goodrich, SG Kobourov
Discrete & Computational Geometry 25, 405-418, 2001
Optimal polygonal representation of planar graphs
CA Duncan, ER Gansner, YF Hu, M Kaufmann, SG Kobourov
Algorithmica 63, 672-691, 2012
Balanced aspect ratio trees
CA Duncan
The Johns Hopkins University, 2000
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
The system can't perform the operation now. Try again later.
Articles 1–20