John Hershberger
Impact in
-
- Computational Geometry and Mesh Generation
- Computer Graphics and Visualization Techniques
- Signal Processing top 0.5%
- Data Management and Algorithms
Papers in
-
- Computational Geometry and Mesh Generation 92
- Computer Graphics and Visualization Techniques 12
-
- Data Management and Algorithms 55
John Hershberger
129 papers receiving 4.0k citations
Peers
Comparison fields: 5 of 124
- Computer Graphics and Computer-Aided Design 2.4k
- Signal Processing 1.3k
- Computer Vision and Pattern Recognition 1.6k
- Computer Networks and Communications 1.2k
- Computational Theory and Mathematics 534
Countries citing papers authored by John Hershberger
This map shows the geographic impact of John Hershberger'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 John Hershberger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Hershberger more than expected).
Fields of papers citing papers by John Hershberger
This network shows the impact of papers produced by John Hershberger. 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 John Hershberger. The network helps show where John Hershberger may publish in the future.
Co-authors
The 25 scholars most cited alongside John Hershberger, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2020 | 2 | |
| 2 | A Discrete and Dynamic Version of Klee's Measure Problem. | 2011 | 0 |
| 3 | 2011 | 21 | |
| 4 | 2010 | 28 | |
| 5 | 2006 | 4 | |
| 6 | 2005 | 7 | |
| 7 | 2004 | 9 | |
| 8 | Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. | 2003 | 34 |
| 9 | 2001 | 9 | |
| 10 | 1998 | 12 | |
| 11 | Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time | 1997 | 9 |
| 12 | 1995 | 6 | |
| 13 | 1995 | 3 | |
| 14 | An Efficient Solution to the Zookeeper's Problem. | 1994 | 8 |
| 15 | 1994 | 33 | |
| 16 | 1993 | 30 | |
| 17 | 1992 | 11 | |
| 18 | Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). | 1991 | 2 |
| 19 | Computing the visibility graphs of n line segments in O(n n ) time. | 1985 | 3 |
| 20 | 1985 | 38 |
About John Hershberger
John Hershberger is a scholar working on Computer Graphics and Computer-Aided Design, Signal Processing, Computer Vision and Pattern Recognition, Computational Theory and Mathematics and Computer Networks and Communications, having authored 136 papers that have together received 4.4k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (92 papers), Data Management and Algorithms (55 papers), Robotic Path Planning Algorithms (23 papers), Digital Image Processing Techniques (18 papers), Computer Graphics and Visualization Techniques (12 papers), Complexity and Algorithms in Graphs (12 papers), Advanced Numerical Analysis Techniques (12 papers) and 3D Shape Modeling and Analysis (11 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (2.4k citations), Signal Processing (1.3k citations), Computer Vision and Pattern Recognition (1.6k citations), Computer Networks and Communications (1.2k citations) and Computational Theory and Mathematics (534 citations). John Hershberger has collaborated with scholars based in United States, Hungary and Canada. Frequent co-authors include Subhash Suri, Leonidas Guibas, Jack Snoeyink, Li Zhang, Micha Sharir, Jie Gao, An Zhu, Daniel Leven, Robert E. Tarjan and Julien Basch. Their work appears in journals such as Computational Geometry, Algorithmica, Discrete & Computational Geometry, SIAM Journal on Computing and Journal of Algorithms.
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.