Segui
Christian A. Duncan
Christian A. Duncan
Professor of Computer Science, Quinnipiac University
Email verificata su acm.org
Titolo
Citata da
Citata da
Anno
On simultaneous planar graph embeddings
P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ...
Computational Geometry 36 (2), 117-130, 2007
161*2007
Optimal constrained graph exploration
CA Duncan, SG Kobourov, VSA Kumar
ACM Transactions on Algorithms (TALG) 2 (3), 380-402, 2006
1462006
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
1182001
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
952004
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
781998
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
691997
Lombardi drawings of graphs
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
622012
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
622004
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
541998
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 (2), 157-182, 2013
472013
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
462014
Drawing planar graphs with circular arcs
CC Cheng, CA Duncan, MT Goodrich, SG Kobourov
Discrete & Computational Geometry 25 (3), 405-418, 2001
422001
Balanced aspect ratio trees
CA Duncan
The Johns Hopkins University, 2000
422000
Planar orthogonal and polyline drawing algorithms
CA Duncan, MT Goodrich
382013
Optimal polygonal representation of planar graphs
CA Duncan, ER Gansner, YF Hu, M Kaufmann, SG Kobourov
Algorithmica 63 (3), 672-691, 2012
382012
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
362011
Lombardi drawings of graphs
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
International Symposium on Graph Drawing, 195-207, 2010
302010
Drawing with fat edges
CA Duncan, A Efrat, SG Kobourov, C Wenk
International Symposium on Graph Drawing, 162-177, 2001
302001
KD trees are better when cut on the longest side
M Dickerson, CA Duncan, MT Goodrich
European Symposium on Algorithms, 179-190, 2000
282000
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20