Christian A. Duncan
Christian A. Duncan
Associate Professor of Computer Science, Quinnipiac University
Dirección de correo verificada de acm.org
TítuloCitado porAño
On simultaneous planar graph embeddings
P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ...
Computational Geometry 36 (2), 117-130, 2007
145*2007
Optimal constrained graph exploration
CA Duncan, SG Kobourov, VS Kumar
ACM Transactions on Algorithms (TALG) 2 (3), 380-402, 2006
1322006
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
1092001
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
732004
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
731998
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
661997
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
582004
Lombardi Drawings of Graphs.
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
J. Graph Algorithms Appl. 16 (1), 85-108, 2012
562012
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
491998
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
472001
Drawing planar graphs with circular arcs
CC Cheng, CA Duncan, MT Goodrich, SG Kobourov
Discrete & Computational Geometry 25 (3), 405-418, 2001
412001
Drawing trees with perfect angular resolution and polynomial area
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
Discrete & Computational Geometry 49 (2), 157-182, 2013
382013
Balanced aspect ratio trees
CA Duncan
The Johns Hopkins University, 2000
362000
Planar and poly-arc Lombardi drawings
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Löffler
International Symposium on Graph Drawing, 308-319, 2011
342011
Optimal polygonal representation of planar graphs
CA Duncan, ER Gansner, YF Hu, M Kaufmann, SG Kobourov
Algorithmica 63 (3), 672-691, 2012
332012
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
312014
Drawing with fat edges
CA Duncan, A Efrat, SG Kobourov, C Wenk
International Symposium on Graph Drawing, 162-177, 2001
302001
Efficient Perspective-Accurate Silhouette Computation.
G Barequet, CA Duncan, MT Goodrich, S Kumar, M Pop
Symposium on Computational Geometry, 417-418, 1999
261999
Planar orthogonal and polyline drawing algorithms
CA Duncan, MT Goodrich
252013
Lombardi drawings of graphs
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
International Symposium on Graph Drawing, 195-207, 2010
252010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20