Approximation Algorithms for Finding Best Viewpoints (1997)

View PDF

Download Links

by Michael E. Houle , Richard Webber
Venue:Proc. 6th International Symp. on Graph Drawing (GD ’98
Citations:6 - 0 self

Documents Related by Co-Citation

19 Finding the Best Viewpoints for Three-Dimensional Graph Drawings – Peter Eades, Michael E. Houle, Richard Webber - 1997
544 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
19 Drawing Nice Projections of Objects in Space – Prosenjit K. Bose, Franciso Gomez-Martin, Pedro Ramos, Godfried T. Toussaint - 1995
264 A Partial K-Arboretum of Graphs With Bounded Treewidth – Hans L. Bodlaender - 1998
521 An algorithm for drawing general undirected graphs – Tomihisa Kamada, Satoru Kawai - 1989
9061 Introduction to Algorithms – Matteo Frigo, Volker Strumpen - 2009
604 Approximation Algorithms for NP-Hard Problems – D Hochbaum, editor - 1997
555 View Interpolation for Image Synthesis – Shenchang Eric Chen, et al.
473 Graph Drawing by Force-directed Placement – Thomas M. J. Fruchterman, Edward M. Reingold - 1991