Approximation Algorithms for Finding Best Viewpoints (1997)

Cached

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
20 Drawing Nice Projections of Objects in Space – Prosenjit K. Bose, Franciso Gomez-Martin, Pedro Ramos, Godfried T. Toussaint - 1995
520 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
3 Planar configurations which determine few slopes – Robert E Jamison - 1984
3 Structure of slope-critical configurations – Robert E Jamison - 1984
4 Direction trees – Robert E Jamison - 1987
4 Solution of Scott’s problem on the number of directions determined by a point set in 3-space – János Pach, Rom Pinchasi, Micha Sharir - 2004
4 Crooked diagrams with few slopes – J Czyzowicz, A Pelc, I Rival, J Urrutia - 1990
7 Interval Degree and Bandwidth of a Graph – F. V. Fomin, P. A. Golovach - 1998
10 Die Baumweite von Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme – P Scheffler - 1989
9 On the sets of directions determined by n points – P R Scott - 1970
17 Graphs with e edges have pagenumber O – S M Malitz - 1994
24 Some results on tree decomposition of graphs – G Ding, B Oporowski - 1995
7 Pathwidth and Layered Drawings of Trees – Matthew Suderman - 2002
27 Tree-Partite Graphs and the Complexity of Algorithms – D Seese - 1985
75 Domino treewidth – Hans L. Bodlaender, Joost Engelfriet - 1994
26 The geometric thickness of low degree graphs – C Duncan, D Eppstein, S Kobourov - 2004
255 A Partial K-Arboretum of Graphs With Bounded Treewidth – Hans L. Bodlaender - 1998
3 A note on the minimum number of edge-directions of a convex polytope – Shmuel Onn, Rom Pinchasi