Stina S. Bridgeman
Brown University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Stina S. Bridgeman.
technical symposium on computer science education | 2000
Stina S. Bridgeman; Michael T. Goodrich; Stephen G. Kobourov; Roberto Tamassia
We describe a Web-based interactive system, called PILOT, for testing computer science concepts. The strengths of PILOT are its universal access and platform independence, its use as an algorithm visualization tool, its ability to test algorithmic concepts, its support for graph generation and layout, its automated grading mechanism, and its ability to award partial credit to proposed solutions.
Computational Geometry: Theory and Applications | 2000
Stina S. Bridgeman; Giuseppe Di Battista; Walter Didimo; Giuseppe Liotta; Roberto Tamassia; Luca Vismara
Given an orthogonal representation
graph drawing | 1997
Stina S. Bridgeman; Jody Fanto; Ashim Garg; Roberto Tamassia; Luca Vismara
H
graph drawing | 1996
Stina S. Bridgeman; Ashim Garg; Roberto Tamassia
with
technical symposium on computer science education | 2000
Stina S. Bridgeman; Michael T. Goodrich; Stephen G. Kobourov; Roberto Tamassia
n
Journal of Graph Algorithms and Applications | 2000
Stina S. Bridgeman; Roberto Tamassia
vertices and bends, we study the problem of computing a planar orthogonal drawing of
International Journal of Computational Geometry and Applications | 1999
Stina S. Bridgeman; Ashim Garg; Roberto Tamassia
H
IEEE Internet Computing | 1999
Gill Barequet; Christian A. Duncan; Michael T. Goodrich; Stina S. Bridgeman; Roberto Tamassia
with small area. This problem has direct applications to the development of practical graph drawing techniques for information visualization and VLSI layout. In this paper, we introduce the concept of turn-regularity of an orthogonal representation
graph drawing | 2000
Stina S. Bridgeman; Roberto Tamassia
H
symposium on computational geometry | 1997
Gill Barequet; Stina S. Bridgeman; Christian A. Duncan; Michael T. Goodrich; Roberto Tamassia
, provide combinatorial characterizations of it, and show that if