Logo

Login

Approximation Algorithms for Finding Best Viewpoints

Houle, Michael E. and Webber, Richard (1998) Approximation Algorithms for Finding Best Viewpoints. [Conference Paper]

Full text not available from this repository.

Abstract

We address the problem of finding viewpoints that preserve the relational structure of a three-dimensional graph drawing under orthographic parallel projection. Previously, algorithms for finding the best viewpoints under two natural models of viewpoint “goodness” were proposed. Unfortunately, the inherent combinatorial complexity of the problem makes finding exact solutions is impractical. In this paper, we propose two approximation algorithms for the problem, commenting on their design, and presenting results on their performance.

Item Type:Conference Paper
Classifications:M Methods > M.999 Others
G Algorithms and Complexity > G.999 Others
P Styles > P.060 3D
ID Code:289
Deposited By:Arnopolina, Galina
Deposited On:09 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1547&spage=210

Repository Staff Only: item control page

References

1. P.K. Agarwal. Intersection and decomposition Algorithms for planar arrangements; Cambridge University Press.

2. P. Bose, F. Gomez, P. Ramos, and G. Toussaint. Drawing nice projections of objects in space. In Proc. 3rs Int. Symp. Graph Drawing (Passau, Germany), LNCS 1027:52-63, Springer-Verlag, 1995.

3. M.L. Braunstein. Depth perception through motion. Academic press, 1976.

4. I. Bruß and A. Frick. Fast interactive 3-d graph visualization. Graph Drawing (Proc. GD '95), volume 1027 of LNCS, pages 99-110. Springer-Verlag, 1996.

5. T. Calamoneri and A. Massini. On three dimensional layout of interconnection networks. In Proc. 5th Int. Symp. Graph drawing (Rome), LNCS 1353:64-75, Springer-Verlag, 1997.

6. R.F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17(2):199-208, 1996.

7. P. Eades, M. Houle, and R. Webber, Finding the best Viewpoints for three-dimensional graph drawings. In Proc. 5th Int. Symp. Graph drawing (Rome), LNCS 1353:87-98, Springer-Verlag, 1997.

8. H. Edelsbrunner. Algorithms in combinatorial geometry. Springer-Verlag, 1987.

9. J.D. Foley, A. van Dam, S.K. Feiner, and J.F. Hughes. Computer Graphics: Principles and Practice. Addison-Wesley, Reading, MA, 1990.

10. T.M.J. Fruchtermann and E.M. Reingold. Graph drawing by force-directed placement. Software Practice and Experience, 21(11):1129-1164, November 1991.

11. T. Kamada and S. Kawai. A simple method for computing general position in displaying three-dimensional objects. In Computer Vision, Graphics and Image Processing, 41(1):43-56, 1988.

12. K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout Adjustment and the Mental Map. J. of Visual Languages and Computing, pages 183-210, June 1995.

13. R. Motwani. P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.

14. P.H.J.M. Otten, L.P.P.P. van Ginneken. The annealing algorihtm. Kluwer Academic, 1989.

15. H. Plantinga, C.R. Dyer. Visibility, Occlusion, and the Aspect Graph. in Int. J. Computer vision, 5(2):137-160, 1990.

16. C. Ware and G. Franck. Evaluating stereo and motion cues for visualizing information nets in three dimesions. ACM Transactions on Graphics, 15(2):121-140, 1996.

17. D.R. Wood.(1998). Two-bend three-dimensional orthogonal grid drawing of maximum degree five graphs; in this proceedings.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.