David Avis, Thomas C. Shermer, Jack Snoeyink, Godfried Toussaint, Binhai Zhu
Let K be a convex polytope in R d, let h(x) be the hyperplane consisting of all points with first coordinate equal to x, and let A(x) be the area (or volume, if d? 3) of the section K "...
Broadcasting Multiple Messages in Hypercubes (2000)
Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman
We investigate Tm (Q d ), the time required to broadcast m 1 messages in a d-dimensional hypercube under the telephone model. We give exact values for Tm (Q d ) for m 2 for m 2 + 1. For 2 , we...
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Thomas C. Shermer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles oating in R
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Thomas C. Shermer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles oating in R
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Thomas C. Shermer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles oating in R
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Anna Lubiw, Henk Meijer, Kathleen Romanik, Thomas C. Shermer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V; E) in which vertices are mapped to rectangles oating in R
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V,E) in which vertices are mapped to rectangles floating in R 3 parallel to the x, y-plane, with edges represented by...
On a visibility representation for graphs in three dimensions (1998)
Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, ...
This paper proposes a 3-dimensional visibility representation of graphs G = (V,E) in which vertices are mapped to rectangles floating in R 3 parallel to the x, y-plane, with edges represented by...
A Complete Roundness Classification Procedure (1997)
Kurt Mehlhorn, Thomas C. Shermer, Chee K. Yap
We describe a roundness classification procedure, that is, a procedure to determine if the roundness of a planar object I is within some ffl 0 from an ideal circle. The procedure consists of a...
Probing for Near-Centers and Estimating Relative Roundness (1996)
Thomas C. Shermer, Chee K. Yap
We present a "complete" 3-step procedure for bounding the relative roundness of a given planar object I. This procedure is based on the probing model. Our method is efficient (being linear...
Visibility properties of polygons / (1989)
Written for the School of Computer Science.