Thomas C. Shermer

1.6k total citations
45 papers, 743 citations indexed

About

Thomas C. Shermer is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Computational Theory and Mathematics. According to data from OpenAlex, Thomas C. Shermer has authored 45 papers receiving a total of 743 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computer Graphics and Computer-Aided Design, 16 papers in Computer Vision and Pattern Recognition and 15 papers in Computational Theory and Mathematics. Recurrent topics in Thomas C. Shermer's work include Computational Geometry and Mesh Generation (31 papers), Advanced Graph Theory Research (13 papers) and Robotic Path Planning Algorithms (8 papers). Thomas C. Shermer is often cited by papers focused on Computational Geometry and Mesh Generation (31 papers), Advanced Graph Theory Research (13 papers) and Robotic Path Planning Algorithms (8 papers). Thomas C. Shermer collaborates with scholars based in Canada, United States and France. Thomas C. Shermer's co-authors include Arthur L. Liestman, Prosenjit Bose, Godfried Toussaint, Binhai Zhu, Andrew Vince, Joan P. Hutchinson, Jorge Urrutia, Sue Whitesides, Frank Hoffmann and Ervin Győri and has published in prestigious journals such as Proceedings of the IEEE, Pattern Recognition Letters and Lecture notes in computer science.

In The Last Decade

Thomas C. Shermer

40 papers receiving 659 citations

Peers

Thomas C. Shermer

CGCD

CVPR

CNC

CTM

Daniel Leven Israel

Thérèse Biedl Canada

Binay Bhattacharya Canada

Chee-Keng Yap United States

Christian Icking Germany

Colm Ó'Dúnlaing United States

Oswin Aichholzer Austria

Hossam ElGindy Australia

Vida Dujmović Canada

Deborah Joseph United States

Daniel Leven Israel

Thomas C. Shermer

512 ×1.2

CGCD

356 ×1.0

CVPR

79 ×0.3

CNC

145 ×0.7

CTM

142 ×0.9

Citations per year, relative to Thomas C. Shermer Thomas C. Shermer (= 1×) peers Daniel Leven

Countries citing papers authored by Thomas C. Shermer

Since Specialization

Citations

This map shows the geographic impact of Thomas C. Shermer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Thomas C. Shermer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas C. Shermer more than expected).

Fields of papers citing papers by Thomas C. Shermer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas C. Shermer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Thomas C. Shermer. The network helps show where Thomas C. Shermer may publish in the future.

Co-authorship network of co-authors of Thomas C. Shermer

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas C. Shermer. A scholar is included among the top collaborators of Thomas C. Shermer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Thomas C. Shermer. Thomas C. Shermer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bose, Prosenjit, et al.. (2020). Computing the k-Visibility Region of a Point in a Polygon. Theory of Computing Systems. 64(7). 1292–1306. 3 indexed citations

Harutyunyan, Hovhannes A., Arthur L. Liestman, Kazuhisa Makino, & Thomas C. Shermer. (2010). Nonadaptive broadcasting in trees. Networks. 57(2). 157–168. 4 indexed citations

Liestman, Arthur L., Thomas C. Shermer, & Ladislav Stacho. (2008). Edge-disjoint spanners in tori. Discrete Mathematics. 309(8). 2239–2249. 4 indexed citations

Ghosh, Subir Kumar, et al.. (2006). Computing the maximum clique in the visibility graph of a simple polygon. Journal of Discrete Algorithms. 5(3). 524–532. 7 indexed citations

Fertin, Guillaume, Arthur L. Liestman, Thomas C. Shermer, & Ladislav Stacho. (2005). Edge-disjoint spanners in Cartesian products of graphs. Discrete Mathematics. 296(2-3). 167–186. 3 indexed citations

Alon, Noga, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, & Ladislav Stacho. (2003). Factor d-domatic colorings of graphs. Discrete Mathematics. 262(1-3). 17–25. 1 indexed citations

Avis, David & Thomas C. Shermer. (2000). POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER. International Journal of Computational Geometry & Applications. 10(1). 55–71.

Liestman, Arthur L., et al.. (1999). Edge-disjoint spanners of complete graphs and complete digraphs. Discrete Mathematics. 203(1-3). 133–159. 3 indexed citations

Hutchinson, Joan P., Thomas C. Shermer, & Andrew Vince. (1999). On representations of some thickness-two graphs. Computational Geometry. 13(3). 161–171. 24 indexed citations

10.

Abello, James, Vladimir Estivill‐Castro, Thomas C. Shermer, & Jorge Urrutia. (1998). Illumination of Orthogonal Polygons with Orthogonal Floodlights. International Journal of Computational Geometry & Applications. 8(1). 25–38. 8 indexed citations

11.

Bose, Prosenjit, et al.. (1997). On Rectangular Visibility Graphs, Graph Drawing. Lecture notes in computer science. 1 indexed citations

12.

Shermer, Thomas C.. (1996). On Rectangle Visibility Graphs. III. External Visibility and Complexity. Canadian Conference on Computational Geometry. 234–239. 14 indexed citations

13.

Shermer, Thomas C., et al.. (1996). On Representations of Some Thickness-two Graphs. Lecture notes in computer science. 2 indexed citations

14.

Liestman, Arthur L., et al.. (1996). Degree-constrained spanners for multidimensional grids. Discrete Applied Mathematics. 68(1-2). 119–144. 6 indexed citations

15.

Győri, Ervin, Frank Hoffmann, Klaus Kriegel, & Thomas C. Shermer. (1996). Generalized guarding and partitioning for rectilinear polygons. Computational Geometry. 6(1). 21–44. 12 indexed citations

16.

Shermer, Thomas C., et al.. (1993). Probing polygons minimally is hard. Computational Geometry. 2(5). 255–265. 12 indexed citations

17.

Shermer, Thomas C.. (1993). On recognizing unions of two convex polygons and related problems. Pattern Recognition Letters. 14(9). 737–745. 2 indexed citations

18.

Shermer, Thomas C.. (1992). Recent Results in Art Galleries. Proceedings of the IEEE. 80(9). 1384–1399. 201 indexed citations

19.

Czyzowicz, Jurek, Hazel Everett, David Rappaport, et al.. (1991). The Aquarium Keeper's Problem. Symposium on Discrete Algorithms. 459–464. 14 indexed citations

20.

Shermer, Thomas C.. (1991). Computing bushy and thin triangulations. Computational Geometry. 1(2). 115–125. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact