default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Hershberger 0001
Person information
- affiliation: Mentor Graphics, Wilsonville, OR, USA
- affiliation: DEC Systems Research Center, Palo Alto, CA, USA
Other persons with the same name
- John Hershberger 0002 — University of South Florida, Tampa, FL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j65]John Hershberger, Subhash Suri, Hakan Yildiz
:
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane. SIAM J. Comput. 51(3): 1296-1340 (2022)- 2020
- [j64]John Hershberger, Neeraj Kumar, Subhash Suri:
Shortest Paths in the Plane with Obstacle Violations. Algorithmica 82(7): 1813-1832 (2020)
2010 – 2019
- 2019
- [j63]Timothy M. Chan, John Hershberger, Simon Pratt:
Two Approaches to Building Time-Windowed Geometric Data Structures. Algorithmica 81(9): 3519-3533 (2019) - 2017
- [j62]Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri:
Hyperplane separability and convexity of probabilistic point sets. J. Comput. Geom. 8(2): 32-57 (2017) - [c79]John Hershberger, Neeraj Kumar, Subhash Suri:
Shortest Paths in the Plane with Obstacle Violations. ESA 2017: 49:1-49:14 - 2016
- [c78]Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri:
Hyperplane Separability and Convexity of Probabilistic Point Sets. SoCG 2016: 38:1-38:16 - [c77]Martin Fink, John Hershberger, Subhash Suri, Kevin Verbeek:
Bundled Crossings in Embedded Graphs. LATIN 2016: 454-468 - [r1]John Hershberger:
Geometric Shortest Paths in the Plane. Encyclopedia of Algorithms 2016: 840-846 - 2015
- [c76]Sylvester David Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek, Hakan Yildiz:
Geometric k Shortest Paths. SODA 2015: 1616-1625 - 2014
- [j61]Luca Foschini, John Hershberger, Subhash Suri:
On the Complexity of Time-Dependent Shortest Paths. Algorithmica 68(4): 1075-1097 (2014) - [c75]John Hershberger, Valentin Polishchuk, Bettina Speckmann, Topi Talvitie:
Geometric kth Shortest Paths: the Applet. SoCG 2014: 96 - [i1]Francisc Bungiu, Michael Hemmer, John Hershberger, Kan Huang, Alexander Kröller:
Efficient Computation of Visibility Polygons. CoRR abs/1403.3905 (2014) - 2013
- [j60]John Hershberger:
Stable snap rounding. Comput. Geom. 46(4): 403-416 (2013) - [j59]Danny Z. Chen, John Hershberger, Haitao Wang:
Computing Shortest Paths amid Convex Pseudodisks. SIAM J. Comput. 42(3): 1158-1184 (2013) - [c74]John Hershberger, Subhash Suri, Hakan Yildiz:
A near-optimal algorithm for shortest paths among curved obstacles in the plane. SoCG 2013: 359-368 - 2011
- [j58]John Hershberger:
Guest Editor's Foreword. Discret. Comput. Geom. 45(4): 593-595 (2011) - [j57]Irene Finocchi, John Hershberger:
Guest editors' foreword. ACM J. Exp. Algorithmics 16 (2011) - [c73]Hakan Yildiz, John Hershberger, Subhash Suri:
A Discrete and Dynamic Version of Klee's Measure Problem. CCCG 2011 - [c72]John Hershberger:
Stable snap rounding. SCG 2011: 197-206 - [c71]Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri:
The Union of Probabilistic Boxes: Maintaining the Volume. ESA 2011: 591-602 - [c70]Luca Foschini, John Hershberger, Subhash Suri:
On the Complexity of Time-Dependent Shortest Paths. SODA 2011: 327-341 - 2010
- [c69]Daniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun:
Road Network Reconstruction for Organizing Paths. SODA 2010: 1309-1320
2000 – 2009
- 2009
- [e2]Irene Finocchi, John Hershberger:
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, January 3, 2009. SIAM 2009, ISBN 978-0-898719-30-7 [contents] - [e1]John Hershberger, Efi Fogel:
Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009. ACM 2009, ISBN 978-1-60558-501-7 [contents] - 2008
- [j56]John Hershberger, Subhash Suri:
Adaptive sampling for geometric problems over data streams. Comput. Geom. 39(3): 191-208 (2008) - [j55]John Hershberger:
Improved Output-Sensitive Snap Rounding. Discret. Comput. Geom. 39(1-3): 298-318 (2008) - [j54]John Hershberger, Nisheeth Shrivastava, Subhash Suri:
Summarizing spatial data streams using ClusterHulls. ACM J. Exp. Algorithmics 13 (2008) - [c68]John Hershberger, Subhash Suri:
Simplified Planar Coresets for Data Streams. SWAT 2008: 5-16 - 2007
- [j53]John Hershberger, Subhash Suri, Amit M. Bhosle:
On the difficulty of some shortest path problems. ACM Trans. Algorithms 3(1): 5:1-5:15 (2007) - [j52]John Hershberger, Matthew Maxel, Subhash Suri:
Finding the k shortest simple paths: A new algorithm and its implementation. ACM Trans. Algorithms 3(4): 45 (2007) - [c67]Sorabh Gandhi, John Hershberger, Subhash Suri:
Approximate isocontours and spatial summaries for sensor networks. IPSN 2007: 400-409 - [c66]Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, John Hershberger:
Sparse data aggregation in sensor networks. IPSN 2007: 430-439 - 2006
- [j51]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica 46(1): 97-117 (2006) - [c65]John Hershberger, Nisheeth Shrivastava, Subhash Suri:
Summarizing Spatial Data Streams Using ClusterHulls. ALENEX 2006: 26-40 - [c64]John Hershberger:
Improved output-sensitive snap rounding. SCG 2006: 357-366 - [c63]Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri:
Contour Approximation in Sensor Networks. DCOSS 2006: 356-371 - [c62]John Hershberger, Nisheeth Shrivastava, Subhash Suri:
Cluster Hull: A Technique for Summarizing Spatial Data Streams. ICDE 2006: 138 - 2005
- [j50]John Hershberger:
Smooth kinetic maintenance of clusters. Comput. Geom. 31(1-2): 3-30 (2005) - [j49]Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink:
Polygonal path simplification with angle constraints. Comput. Geom. 32(3): 173-187 (2005) - [j48]Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu:
Geometric spanners for routing in mobile networks. IEEE J. Sel. Areas Commun. 23(1): 174-185 (2005) - [j47]John Hershberger, Subhash Suri, Csaba D. Tóth:
Binary Space Partitions of Orthogonal Subdivisions. SIAM J. Comput. 34(6): 1380-1397 (2005) - [c61]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Space complexity of hierarchical heavy hitters in multi-dimensional data streams. PODS 2005: 338-347 - 2004
- [j46]Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang:
Kinetic collision detection between two simple polygons. Comput. Geom. 27(3): 211-235 (2004) - [j45]John Hershberger:
Kinetic collision detection with fast flight plan changes. Inf. Process. Lett. 92(6): 287-291 (2004) - [c60]John Hershberger, Subhash Suri, Csaba D. Tóth:
Binary space partitions of orthogonal subdivisions. SCG 2004: 230-238 - [c59]Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang:
Fractionally cascaded information in a sensor network. IPSN 2004: 311-319 - [c58]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams. ISAAC 2004: 522-533 - [c57]John Hershberger, Subhash Suri:
Adaptive Sampling for Geometric Problems over Data Streams. PODS 2004: 252-262 - 2003
- [j44]Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu:
Discrete Mobile Centers. Discret. Comput. Geom. 30(1): 45-63 (2003) - [c56]John Hershberger, Matthew Maxel, Subhash Suri:
Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. ALENEX 2003: 26-36 - [c55]John Hershberger:
Smooth kinetic maintenance of clusters. SCG 2003: 48-57 - [c54]John Hershberger, Subhash Suri:
Binary space partitions for 3D subdivisions. SODA 2003: 100-108 - [c53]John Hershberger, Subhash Suri, Amit M. Bhosle:
On the Difficulty of Some Shortest Path Problems. STACS 2003: 343-354 - 2002
- [j43]Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson:
Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002) - [j42]Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang:
Deformable Free-Space Tilings for Kinetic Collision Detection. Int. J. Robotics Res. 21(3): 179-198 (2002) - [c52]John Hershberger, Subhash Suri:
Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". FOCS 2002: 809- - 2001
- [j41]Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang:
Kinetic Connectivity for Unit Disks. Discret. Comput. Geom. 25(4): 591-610 (2001) - [j40]Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach:
Maintaining the Extent of a Moving Point Set. Discret. Comput. Geom. 26(3): 353-374 (2001) - [j39]John Hershberger:
Guest Editor's Foreword - Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, Minnesota, June 1998. Int. J. Comput. Geom. Appl. 11(3): 243-244 (2001) - [c51]Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu:
Discrete mobile centers. SCG 2001: 188-196 - [c50]John Hershberger, Subhash Suri:
Vickrey Prices and Shortest Paths: What is an Edge Worth?. FOCS 2001: 252-259 - [c49]Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu:
Geometric spanner for routing in mobile networks. MobiHoc 2001: 45-55 - [c48]John Hershberger, Subhash Suri:
Simplified kinetic connectivity for rectangles and hypercubes. SODA 2001: 158-167 - [c47]Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink:
Polygonal path approximation with angle constraints. SODA 2001: 342-343 - 2000
- [j38]Leonidas J. Guibas, John Hershberger, Subhash Suri:
Morphing Simple Polygons. Discret. Comput. Geom. 24(1): 1-34 (2000) - [j37]Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions. Discret. Comput. Geom. 24(4): 721-733 (2000) - [c46]Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang:
Kinetic connectivity for unit disks. SCG 2000: 331-340
1990 – 1999
- 1999
- [j36]Julien Basch, Leonidas J. Guibas, John Hershberger:
Data Structures for Mobile Data. J. Algorithms 31(1): 1-28 (1999) - [j35]John Hershberger, Subhash Suri:
An Optimal Algorithm for Euclidean Shortest Paths in the Plane. SIAM J. Comput. 28(6): 2215-2256 (1999) - [c45]John Hershberger, Subhash Suri:
Kinetic Connectivity of Rectangles. SCG 1999: 237-246 - [c44]Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions. SCG 1999: 247-254 - [c43]Julien Basch, João Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang:
Kinetic Data Structures: Animating Proofs Through Time. SCG 1999: 427-428 - [c42]Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang:
Kinetic Collision Detection Between Two Simple Polygons. SODA 1999: 102-111 - 1998
- [j34]John Hershberger, Jack Snoeyink:
Erased arrangements of lines and convex decompositions of polyhedra. Comput. Geom. 9(3): 129-143 (1998) - [j33]John Hershberger, Subhash Suri:
Practical methods for approximating shortest paths on a convex polytope in R3. Comput. Geom. 10(1): 31-46 (1998) - [j32]John Hershberger, Jack Snoeyink:
Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. Comput. Geom. 11(3-4): 175-185 (1998) - 1997
- [j31]John Hershberger, Subhash Suri:
Finding a Shortest Diagonal of a Simple Polygon in Linear Time. Comput. Geom. 7: 149-160 (1997) - [j30]John Hershberger, Subhash Suri:
Matrix Searching with the Shortest-Path Metric. SIAM J. Comput. 26(6): 1612-1634 (1997) - [c41]Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum:
Snap Rounding Line Segments Efficiently in Two and Three Dimensions. SCG 1997: 284-293 - [c40]John Hershberger, Subhash Suri:
Efficient Breakout Routing in Printed Circuit Boards. SCG 1997: 460-462 - [c39]Julien Basch, Leonidas J. Guibas, John Hershberger:
Data Structures for Mobile Data. SODA 1997: 747-756 - [c38]Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach:
Maintaining the Extent of a Moving Point Set. WADS 1997: 31-44 - [c37]John Hershberger, Jack Snoeyink:
Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. WADS 1997: 93-103 - [c36]John Hershberger, Subhash Suri:
Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). WADS 1997: 462-471 - 1996
- [j29]John Hershberger, Subhash Suri:
Off-Line Maintenance of Planar Configurations. J. Algorithms 21(3): 453-475 (1996) - [j28]Joseph Friedman, John Hershberger, Jack Snoeyink:
Efficiently Planning Compliant Motion in the Plane. SIAM J. Comput. 25(3): 562-599 (1996) - 1995
- [j27]John Hershberger:
Optimal parallel algorithms for triangulated simple polygons. Int. J. Comput. Geom. Appl. 5: 145-170 (1995) - [j26]John Hershberger, Subhash Suri:
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. J. Algorithms 18(3): 403-431 (1995) - [c35]Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter:
The Centroid of Points with Approximate Weights. ESA 1995: 460-472 - [c34]John Hershberger, Subhash Suri:
Morphing Binary Trees. SODA 1995: 396-404 - [c33]John Hershberger, Subhash Suri:
Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. SODA 1995: 447-456 - 1994
- [j25]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994) - [j24]John Hershberger, Jack Snoeyink:
Computing Minimum Length Paths of a Given Homotopy Class. Comput. Geom. 4: 63-97 (1994) - [j23]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir:
Selecting Heavily Covered Points. SIAM J. Comput. 23(6): 1138-1151 (1994) - [j22]John Hershberger, Monika Rauch, Subhash Suri:
Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. 130(1): 139-161 (1994) - [c32]John Hershberger, Jack Snoeyink:
An Efficient Solution to the Zookeeper's Problem. CCCG 1994: 104-109 - [c31]Leonidas J. Guibas, John Hershberger:
Morphing Simple Polygons. SCG 1994: 267-276 - [c30]John Hershberger, Jack Snoeyink:
An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. SCG 1994: 383-384 - 1993
- [j21]David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri:
Computing the Intersection-Depth of Polyhedra. Algorithmica 9(6): 518-533 (1993) - [j20]David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink:
An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. Algorithmica 10(1): 1-23 (1993) - [j19]Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths. Int. J. Comput. Geom. Appl. 3(4): 383-415 (1993) - [j18]John Hershberger:
A Faster Algorithm for the Two-Center Decision Problem. Inf. Process. Lett. 47(1): 23-29 (1993) - [c29]John Hershberger:
Compliant Motion in a Simple Polygon. SCG 1993: 397-398 - [c28]John Hershberger, Subhash Suri:
Efficient Computation of Euclidean Shortest Paths in the Plane. FOCS 1993: 508-517 - [c27]John Hershberger, Subhash Suri:
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. SODA 1993: 54-63 - [c26]John Hershberger, Subhash Suri:
Matrix searching with the shortest path metric. STOC 1993: 485-494 - 1992
- [j17]John Hershberger, Subhash Suri:
Applications of a Semi-Dynamic Convex Hull Algorithm. BIT 32(2): 249-267 (1992) - [j16]John Hershberger:
Upper Envelope Onion Peeling. Comput. Geom. 2: 93-110 (1992) - [j15]John Hershberger:
Minimizing the Sum of Diameters Efficiently. Comput. Geom. 2: 111-118 (1992) - [j14]Marc H. Brown, John Hershberger:
Color and Sound in Algorithmic Animation. Computer 25(12): 52-63 (1992) - [c25]John Hershberger:
Optimal Parallel Algorithms for Triangulated Simple Polygons. SCG 1992: 33-42 - [c24]John Hershberger, Monika Rauch, Subhash Suri:
Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992: 233-244 - [c23]John Hershberger, Jack Snoeyink:
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. SWAT 1992: 376-387 - 1991
- [j13]Leonidas J. Guibas, John Hershberger, Jack Snoeyink:
Compact interval trees: a data structure for convex hulls. Int. J. Comput. Geom. Appl. 1(1): 1-22 (1991) - [j12]John Hershberger:
A New Data Structure for Shortest Path Queries in a Simple Polygon. Inf. Process. Lett. 38(5): 231-235 (1991) - [j11]John Hershberger, Subhash Suri:
Finding Tailored Partitions. J. Algorithms 12(3): 431-463 (1991) - [c22]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646 - [c21]Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths. ISA 1991: 151-162 - [c20]John Hershberger, Subhash Suri:
Offline Maintenance of Planar Configurations. SODA 1991: 32-41 - [c19]Marc H. Brown, John Hershberger:
Color and Sound in Algorithm Animation. VL 1991: 10-17 - [c18]John Hershberger, Jack Snoeyink:
Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). WADS 1991: 331-342 - 1990
- [c17]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir:
Slimming Down by Adding: Selecting Heavily Covered Points. SCG 1990: 116-127 - [c16]Jack Snoeyink, John Hershberger:
Sweeping Arrangements of Curves. Discrete and Computational Geometry 1990: 309-350 - [c15]David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri:
Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms 1990: 165-180 - [c14]Leonidas J. Guibas, John Hershberger, Jack Snoeyink:
Compact Interval Trees: A Data Structure for Convex Hulls. SODA 1990: 169-178 - [c13]Joseph Friedman, John Hershberger, Jack Snoeyink:
Input-Sensitive Compliant Motion in the Plane. SWAT 1990: 225-237 - [c12]John Hershberger:
Upper Envelope Onion Peeling. SWAT 1990: 368-379 - [c11]John Hershberger, Subhash Suri:
Applications of a Semi-Dynamic Convex Hull Algorithm. SWAT 1990: 380-392
1980 – 1989
- 1989
- [j10]John Hershberger:
An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons. Algorithmica 4(1): 141-155 (1989) - [j9]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. 4: 433-466 (1989) - [j8]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. 4: 523-539 (1989) - [j7]John Hershberger:
Finding the Upper Envelope of n Line Segments in O(n log n) Time. Inf. Process. Lett. 33(4): 169-174 (1989) - [j6]Leonidas J. Guibas, John Hershberger:
Optimal Shortest Path Queries in a Simple Polygon. J. Comput. Syst. Sci. 39(2): 126-152 (1989) - [c10]Joseph Friedman, John Hershberger, Jack Snoeyink:
Compliant Motion in a Simple Polygon. SCG 1989: 175-186 - [c9]John Hershberger, Subhash Suri:
Finding Tailored Partitions. SCG 1989: 255-265 - [c8]Jack Snoeyink, John Hershberger:
Sweeping Arrangements of Curves. SCG 1989: 354-363 - 1988
- [j5]John Hershberger, Leonidas J. Guibas:
An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. J. Algorithms 9(1): 18-46 (1988) - [c7]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. SCG 1988: 56-69 - [c6]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG 1988: 258-265 - [c5]David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink:
An efficient algorithm for finding the CSG representation of a simple polygon. SIGGRAPH 1988: 31-40 - 1987
- [b1]John Hershberger:
Efficient algorithms for shortest path and visibility problems. Stanford University, USA, 1987 - [j4]Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan:
Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. Algorithmica 2: 209-233 (1987) - [c4]John Hershberger:
Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. SCG 1987: 11-20 - [c3]Leonidas J. Guibas, John Hershberger:
Optimal Shortest Path Queries in a Simple Polygon. SCG 1987: 50-63 - 1986
- [j3]Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai:
Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986) - [c2]Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan:
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. SCG 1986: 1-13 - 1985
- [j2]Joan Feigenbaum, John Hershberger, Alejandro A. Schäffer:
A polynomial time algorithm for finding the prime factors of cartesian-product graphs. Discret. Appl. Math. 12(2): 123-138 (1985) - [j1]Leonidas J. Guibas, John Hershberger:
Computing the visibility graphs of n line segments in O(nn) time. Bull. EATCS 26: 13-20 (1985) - [c1]Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai:
Visibility-Polygon Search and Euclidean Shortest Paths. FOCS 1985: 155-164
Coauthor Index
[j65] [j64] [j62] [c79] [c78] [c77] [c76] [j61] [c74] [c73] [c71] [c70] [j56] [j54] [c68] [j53] [j52] [c67] [j51] [c65] [c63] [c62] [j47] [c61] [c60] [c58] [c57] [c56] [c54] [c53] [j43] [c52] [j41] [c50] [c48] [j38] [c46] [j35] [c45] [j33] [j31] [j30] [c40] [c36] [j29] [j26] [c35] [c34] [c33] [j22] [j21] [c28] [c27] [c26] [j17] [c24] [j11] [c20] [c15] [c11] [c9]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
