Recent Papers

Center for Geometric Computing at Brown

References

1

Giuseppe Liotta, Franco P. Preparata, and Roberto Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. SIAM J. Computing. to appear.

2

Y.-J. Chiang and R. Tamassia. Optimal shortest path and minimum-link path queries between two convex polygons inside a simple polygonal obstacle. Internat. J. Comput. Geom. Appl. to appear.

3

W. Lenhart and G. Liotta. Proximity drawings of outerplanar graphs. In S. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science. Springer-Verlag, 1997. to appear.

4

A. Garg and R. Tamassia. A new minimum cost flow algorithm with applications to graph drawing. In S. C. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science. Springer-Verlag, 1997.

5

A. Garg and R. Tamassia. GIOTTO3D: A system for visualizing hierarchical structures in 3D. In S. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science. Springer-Verlag, 1997. to appear.

6

G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, and L. Vismara. Drawing directed graphs: an experimental study,. In S. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science. Springer-Verlag, 1997. to appear.

7

T. Chan, M. T. Goodrich, S. R. Kosaraju, and R. Tamassia. Optimizing area and aspect ratio in straight-line orthogonal tree drawings,. In S. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science. Springer-Verlag, 1997. to appear.

8

S. Bridgeman, A. Garg, and R. Tamassia. A graph drawing and translation service on the WWW. In S. C. North, editor, Graph Drawing (Proc. GD '96), Lecture Notes in Computer Science. Springer-Verlag, 1997.

9

G. Liotta, R. Tamassia, I.G. Tollis, and P. Vocca. Area requirement of Gabriel drawings. In Algorithms and Complexity (Proc. CIAC' 97), Lecture Notes in Computer Science. Springer-Verlag, 1997. to appear.

10

G. Kant, G. Liotta, R. Tamassia, and I. G. Tollis. Area requirement of visibility representations of trees. Information Processing Letters, 1997. to appear.

11

G. Liotta, A. Lubiw, H. Meijer, and S. H. Whitesides. The rectangle of influence drawability problem. Technical Report CS-96-22, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

12

W. Lenhart and G. Liotta. Proximity drawings of outerplanar graphs. Technical Report CS-96-21, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

13

W. Lenhart and G. Liotta. How to draw outerplanar minimum weight triangulations. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 373-384. Springer-Verlag, 1996.

14

W. Lenhart and G. Liotta. Drawing outerplanar minimum weight triangulations. Inform. Process. Lett., 6(12):253-260, 1996.

15

G. Liotta. Low degree algorithms for computing and checking Gabriel graphs. Technical Report CS-96-28, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

16

G. Kant, G. Liotta, R. Tamassia, and I. G. Tollis. Visibility representations of trees. Technical Report CS-96-23, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

17

A. Garg, R. Tamassia, and P. Vocca. Drawing with colors. In Proc. 4th Annu. European Sympos. Algorithms (ESA '96), 1996.

18

A. Garg, M. T. Goodrich, and R. Tamassia. Planar upward tree drawings with optimal area. Internat. J. Comput. Geom. Appl., 6(3):333-356, 1996.

19

P. Eades, X. Lin, and R. Tamassia. An algorithm for drawing a hierarchical graph. Internat. J. Comput. Geom. Appl., 6:145-156, 1996.

20

G. Di Battista, G. Liotta, and S. H. Whitesides. The strength of weak proximity. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 178-189. Springer-Verlag, 1996.

21

G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl. to appear.

22

G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, and L. Vismara. Drawing directed graphs: an experimental study,. Technical Report CS-96-24, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

23

O. Devillers and F. P. Preparata. A probabilistic analysis of the power of arithmetic filters. Technical Report CS-96-27, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996.

24

Y.-J. Chiang, F. P. Preparata, and R. Tamassia. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. SIAM J. Comput., 25:207-233, 1996.

25

Marek Chrobak, Michael T. Goodrich, and Roberto Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 319-328, 1996.

26

L. Buti, G. Di Battista, G. Liotta, E. Tassinari, F. Vargiu, and L. Vismara. GD-workbench: a system for prototyping and testing graph drawing algorithms. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 111-122. Springer-Verlag, 1996.

27

P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity constraints and representable trees. Technical Report RT-INF-9-96, Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III, 1996.

28

J. E. Baker, I. F. Cruz, G. Liotta, and R. Tamassia. The Mocha algorithm animation system. In Proc. Int. Workshop on Advanced Visual Interfaces (AVI '96), pages 248-250, 1996.

29

James E. Baker, Isabel F. Cruz, Giuseppe Liotta, and Roberto Tamassia. Animating geometric algorithms over the Web. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages C3-C4, 1996.

30

J. E. Baker, I. F. Cruz, G. Liotta, and R. Tamassia. Algorithm animation over the World Wide Web. In Proc. Int. Workshop on Advanced Visual Interfaces (AVI '96), pages 203-212, 1996.

31

A. Garg and R. Tamassia. Upward planarity testing. Order, 12:109-133, 1995.

32

A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 286-297. Springer-Verlag, 1995.

33

G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of three graph drawing algorithms. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 306-315, 1995.

34

R. F. Cohen and R. Tamassia. Dynamic expression trees. Algorithmica, 13:245-265, 1995.

35

Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 139-149, 1995.

36

R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput., 24(5):970-1001, 1995.

37

J. E. Baker, I. F. Cruz, G. Liotta, and R. Tamassia. A new model for algorithm animation over the WWW. ACM Comput. Surv., 27(4):568-572, 1995.