PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Duncan, Christian A."

Author of the publication

copydeleteadd this publication to your clipboard
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees.

, , and . J. Algorithms, 38 (1): 303-333 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

A. Laukemann

A. Laukemann

A. Laukemann

A. Vo{\ss}

A. Afkari

 

Other publications of authors with the same name

On simultaneous planar graph embeddings., , , , , , , , and . Comput. Geom., 36 (2): 117-130 (2007)Lombardi Drawings of Graphs., , , , and . J. Graph Algorithms Appl., 16 (1): 85-108 (2012)Drawing Trees with Perfect Angular Resolution and Polynomial Area., , , , and . Graph Drawing, volume 6502 of Lecture Notes in Computer Science, page 183-194. Springer, (2010)Planar and Poly-arc Lombardi Drawings., , , , and . Graph Drawing, volume 7034 of Lecture Notes in Computer Science, page 308-319. Springer, (2011)Real-time classification of dynamic hand gestures from marker-based position data., , , and . IUI Companion, page 13-16. ACM, (2013)Optimal constrained graph exploration., , and . SODA, page 807-814. ACM/SIAM, (2001)On Graph Thickness, Geometric Thickness, and Separator Theorems.. CCCG, page 13-16. (2009)Tight bounds on maximal and maximum matchings., , , , and . Discrete Mathematics, 285 (1-3): 7-15 (2004)On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks., , and . Theory Comput. Syst., 33 (5/6): 393-426 (2000)Drawing with Fat Edges., , , and . Int. J. Found. Comput. Sci., 17 (5): 1143-1164 (2006)