Stephen Wismath  Research Interests
Department of Mathematics and Computer Science,
University of Lethbridge,
Visitors:
I gratefully acknowledge NSERC for their support of my research.
Computational Geometry
Visibility:
 Characterizing Bar LineofSight Graphs,
Wismath, S.,
Proceedings of the Symposium on Computational Geometry,
Baltimore, 1985, pp. 147152.

Determining barrepresentability for ordered weighted graphs,
Kirkpatrick, D.; Wismath, S. ,
Computational Geometry: Theory and Applications,
Vol 6, No. 2, May 1996, pp. 99122.
 Computing the Full Visibility Graph of a Set of Line Segments,
Wismath,S.,
Information Processing Letters, 42, July 1992, pp. 257261.
 Visibility Stabs and DepthFirst Spiralling on Line Segments
in Output Sensitive Time,
Keil, M.; Mount, D.; Wismath, S.;
Int. J. of Computational Geometry and Applications, Vol 10, No. 5,
Oct. 2000, pp.535552.
 Point and Line Segment Reconstruction from Visibility Information,
Wismath, S.,
Int. J. of Computational Geometry and Applications, Vol. 10, No. 2 (2000)
pp. 189200.
 Orthogonal Polygon Reconstruction from Stabbing Information,
Jackson, L.; Wismath, S.,
Computational Geometry: Theory and Applications, Vol. 23, No. 1,
pp. 6983, July 2002.

Properties of Arrangement Graphs,
Bose, J.; Everett, H.; Wismath, S.;
Int. J. of Computational Geometry and Applications  accepted, to appear.
Graph Drawing
 Bounds for Orthogonal 3D Graph Drawing,
Biedl, T.; Shermer, T.; Whitesides, S.; Wismath, S.;
Journal of Graph Algorithms and Applications
,
(special issue on new trends in Graph Drawing) Vol. 3, No. 4, 1999,
pp. 6379.
 Fully Dynamic ThreeDimensional Orthogonal Graph Drawing
Closson, M.; Gartshore, S.; Johansen, J.; Wismath, S.;
Journal of Graph Algorithms and Applications,
Vol 5, No. 2, 2001 pp. 134.
 StraightLine Drawings on Restricted Integer Grids in Two and Three
Dimensions;
Felsner, S.; Liotta, G.; Wismath, S.;
As submitted to (special issue)
Journal of Graph Algorithms and Applications,
(JGAA) (Jan 2003) pp.133.
Accepted and presented at
Graph Drawing 2001 in Vienna, Sept.2326.
SpringerVerlag Lecture Notes in Computer Science 2265, pp. 328342.
 The klines Drawability Problem for SeriesParallel Graphs ;
Di Giacomo, Liotta, Wismath;
U of Lethbridge Technical Report TRCS0202, pp. 132
accepted and presented at CCCG02,
August 1214, 2002.
 Book Embeddability of SeriesParallel Digraphs ;
Di Giacomo, Didimo, Liotta, Wismath;
Submitted to Algorithmica.
Accepted and presented at Graph Drawing 2002, Irvine,
August 2628, 2002.
 3Dimensional StraightLine Graph Drawing ,
S. Wismath,
As presented at the
Journées de Géométrie
Algorithmique 2002
held in Obernai, France,
Oct 1418, 2002.
 Drawing Planar Graphs on a Curve ;
Di Giacomo, Didimo, Liotta, Wismath;
Accepted and presented at
WG2003  29th Workshop on Graph Theoretic Concepts in Computer Science,
June 2003
Software and Scientific Visualization

VisPak: A Package of Visibility Algorithms Written in LEDA
Jackson, L.; Pinto, H.; Wismath, S.
,
Technical Report ULCS951, 1995.

ArrangePak, OrthoPak and VisPak 2.0
,
Closson, M.; Everett, H; Gartshore, S.; Wismath S;
University of Lethbridge Technical Report TRCS0198, 1998.

GLuskap: Visualization and Manipulation of Graph Drawings in 3D ;
Dyck, B.; Joevenazzo, J.; Nickle, E.; Wilsdon, J.; Wismath, S.
Poster/demo accepted at
Graph Drawing 2003,
September 2003, Perugia, Italy.

ArrangePak3D ;
Dufresne, R.; Nickle, E.; Wismath, S.
Program Committees
I have served recently on the program committees for:
 Graph Drawing 2005
Limerick Ireland in September 2005.

the 17th Canadian Conference on Computational Geometry
U. of Windsor in Aug. 2005.

The 2004 International Conference on Computational Science and its Applications (ICCSA2004)
held in Italy in May, 2004.
 Graph Drawing 2003
held in Perugia, Italy
September 2124, 2003.
 Canadian Conference on Computational Geometry 2003
held in Halifax
in August, 2003.

The 2003 International Conference on Computational Science and its Applications (ICCSA2003)
held in Montreal
in May, 2003.

14th Canadian Conference on Computational Geometry, hosted
in Lethbridge August 1214, 2002.
 Graph Drawing 2000
held in Williamsburg, Virginia, Sept. 2023, 2000.

the 12th Canadian Conference on Computational Geometry
held
at the U. of New Brunswick in Aug. 2000.
Graduate Students:
LillAnne Jackson  graduated in 1996  currently doing a PhD in CS at
the U. of Calgary.
Elpseth Nickle  started Jan 2003 (cosupervised with Dr. D. Gaur).
Sebastian Hanlon  started Sept. 2004.
Undergraduate summer students:
In the last several years, I have hired the following undergraduate students to
work on research projects:
Helen Pinto, Michael Closson, Shane Gartshore,
John Johansen,
Breanne Dyck, Jill Joevenazzo, Jon Wilsdon, Sebastian Hanlon, Ray Dufresne, Kim Hansen.
Summer of 2005: Carrie Wang, Ethan Kim
Open Problems:

Can all outerplanar graphs be drawn in 2D in O(n) area?

Can all planar graphs be drawn in 3D in O(n) volume?