2013
135Stable snap rounding. John Hershberger. Comput. Geom. (46): 403-416 (2013). Web SearchBibTeXDownload
2011
134Guest editors' foreword. Pinar Heggernes, Gianluigi Zavattaro, Oriol Serra. ACM Journal of Experimental Algorithmics (16) (2011). Web SearchBibTeXDownload
133A Discrete and Dynamic Version of Klee's Measure Problem. Hakan Yildiz, John Hershberger, Subhash Suri. CCCG 2011. Web SearchBibTeXDownload
132Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Discrete & Computational Geometry (45): 593-595 (2011). Web SearchBibTeXDownload
131The Union of Probabilistic Boxes: Maintaining the Volume. Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri. ESA 2011, 591-602. Web SearchBibTeXDownload
130On the Complexity of Time-Dependent Shortest Paths. Luca Foschini, John Hershberger, Subhash Suri. SODA 2011, 327-341. Web SearchBibTeXDownload
129Stable snap rounding. John Hershberger. Symposium on Computational Geometry 2011, 197-206. Web SearchBibTeXDownload
2010
128Road Network Reconstruction for Organizing Paths. Daniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun. SODA 2010, 1309-1320. Web SearchBibTeXDownload
2008
127Summarizing spatial data streams using ClusterHulls. John Hershberger, Nisheeth Shrivastava, Subhash Suri. ACM Journal of Experimental Algorithmics (13) (2008). Web SearchBibTeXDownload
126Adaptive sampling for geometric problems over data streams. John Hershberger, Subhash Suri. Comput. Geom. (39): 191-208 (2008). Web SearchBibTeXDownload
125Improved Output-Sensitive Snap Rounding. John Hershberger. Discrete & Computational Geometry (39): 298-318 (2008). Web SearchBibTeXDownload
124Simplified Planar Coresets for Data Streams. John Hershberger, Subhash Suri. SWAT 2008, 5-16. Web SearchBibTeXDownload
2007
123Finding the k shortest simple paths: A new algorithm and its implementation. John Hershberger, Matthew Maxel, Subhash Suri. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
122On the difficulty of some shortest path problems. John Hershberger, Subhash Suri, Amit M. Bhosle. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
121Sparse data aggregation in sensor networks. Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, John Hershberger. IPSN 2007, 430-439. Web SearchBibTeXDownload
120Approximate isocontours and spatial summaries for sensor networks. Sorabh Gandhi, John Hershberger, Subhash Suri. IPSN 2007, 400-409. Web SearchBibTeXDownload
2006
119Summarizing Spatial Data Streams Using ClusterHulls. John Hershberger, Nisheeth Shrivastava, Subhash Suri. ALENEX 2006, 26-40. Web SearchBibTeXDownload
118Adaptive Spatial Partitioning for Multidimensional Data Streams. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. Algorithmica (46): 97-117 (2006). Web SearchBibTeXDownload
117Contour Approximation in Sensor Networks. Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri. DCOSS 2006, 356-371. Web SearchBibTeXDownload
116Cluster Hull: A Technique for Summarizing Spatial Data Streams. John Hershberger, Nisheeth Shrivastava, Subhash Suri. ICDE 2006, 138. Web SearchBibTeXDownload
115Improved output-sensitive snap rounding. John Hershberger. Symposium on Computational Geometry 2006, 357-366. Web SearchBibTeXDownload
2005
114Polygonal path simplification with angle constraints. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink. Comput. Geom. (32): 173-187 (2005). Web SearchBibTeXDownload
113Smooth kinetic maintenance of clusters. John Hershberger. Comput. Geom. (31): 3-30 (2005). Web SearchBibTeXDownload
112Geometric spanners for routing in mobile networks. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. IEEE Journal on Selected Areas in Communications (23): 174-185 (2005). Web SearchBibTeXDownload
111Space complexity of hierarchical heavy hitters in multi-dimensional data streams. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. PODS 2005, 338-347. Web SearchBibTeXDownload
110Binary Space Partitions of Orthogonal Subdivisions. John Hershberger, Subhash Suri, Csaba D. Tóth. SIAM J. Comput. (34): 1380-1397 (2005). Web SearchBibTeXDownload
2004
109Kinetic collision detection between two simple polygons. Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang. Comput. Geom. (27): 211-235 (2004). Web SearchBibTeXDownload
108Kinetic collision detection with fast flight plan changes. John Hershberger. Inf. Process. Lett. (92): 287-291 (2004). Web SearchBibTeXDownload
107Fractionally cascaded information in a sensor network. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang. IPSN 2004, 311-319. Web SearchBibTeXDownload
106Adaptive Spatial Partitioning for Multidimensional Data Streams. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. ISAAC 2004, 522-533. Web SearchBibTeXDownload
105Adaptive Sampling for Geometric Problems over Data Streams. John Hershberger, Subhash Suri. PODS 2004, 252-262. Web SearchBibTeXDownload
104Multi-attribute exchange market: search for optimal matches. Eugene Fink, Jianli Gong, John Hershberger. SMC (5) 2004, 4140-4146. Web SearchBibTeXDownload
103Binary space partitions of orthogonal subdivisions. John Hershberger, Subhash Suri, Csaba D. Tóth. Symposium on Computational Geometry 2004, 230-238. Web SearchBibTeXDownload
2003
102Multi-attribute exchange market: representation and indexing of orders. Eugene Fink, Josh Johnson, John Hershberger. ACM Conference on Electronic Commerce 2003, 186-187. Web SearchBibTeXDownload
101Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. John Hershberger, Matthew Maxel, Subhash Suri. ALENEX 2003, 26-36. Web SearchBibTeX
100Multi-attribute Exchange Market: Theory and Experiments. Eugene Fink, Josh Johnson, John Hershberger. Canadian Conference on AI 2003, 603-610. Web SearchBibTeXDownload
99Discrete Mobile Centers. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. Discrete & Computational Geometry (30): 45-63 (2003). Web SearchBibTeXDownload
98Fast-paced trading of multi-attribute goods. Eugene Fink, Josh Johnson, John Hershberger. SMC 2003, 4280-4287. Web SearchBibTeXDownload
97Binary space partitions for 3D subdivisions. John Hershberger, Subhash Suri. SODA 2003, 100-108. Web SearchBibTeXDownload
96On the Difficulty of Some Shortest Path Problems. John Hershberger, Subhash Suri, Amit M. Bhosle. STACS 2003, 343-354. Web SearchBibTeXDownload
95Smooth kinetic maintenance of clusters. John Hershberger. Symposium on Computational Geometry 2003, 48-57. Web SearchBibTeXDownload
2002
94Algorithmic issues in modeling motion. 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. ACM Comput. Surv. (34): 550-572 (2002). Cited by 41Web SearchBibTeXDownload
93Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". John Hershberger, Subhash Suri. FOCS 2002, 809. Web SearchBibTeXDownload
92Deformable Free-Space Tilings for Kinetic Collision Detection. Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang. I. J. Robotic Res. (21): 179-198 (2002). Web SearchBibTeXDownload
2001
91Maintaining the Extent of a Moving Point Set. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach. Discrete & Computational Geometry (26): 353-374 (2001). Web SearchBibTeXDownload
90Kinetic Connectivity for Unit Disks. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang. Discrete & Computational Geometry (25): 591-610 (2001). Web SearchBibTeXDownload
89Vickrey Prices and Shortest Paths: What is an Edge Worth?. John Hershberger, Subhash Suri. FOCS 2001, 252-259. Web SearchBibTeXDownload
88Guest Editor's Foreword - Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, Minnesota, June 1998. John Hershberger. Int. J. Comput. Geometry Appl. (11): 243-244 (2001). Web SearchBibTeX
87Geometric spanner for routing in mobile networks. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. MobiHoc 2001, 45-55. Web SearchBibTeXDownload
86Simplified kinetic connectivity for rectangles and hypercubes. John Hershberger, Subhash Suri. SODA 2001, 158-167. Web SearchBibTeXDownload
85Polygonal path approximation with angle constraints. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink. SODA 2001, 342-343. Web SearchBibTeXDownload
84Discrete mobile centers. Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu. Symposium on Computational Geometry 2001, 188-196. Web SearchBibTeXDownload
2000
83Morphing Simple Polygons. Leonidas J. Guibas, John Hershberger, Subhash Suri. Discrete & Computational Geometry (24): 1-34 (2000). Web SearchBibTeXDownload
82Lower Bounds for Kinetic Planar Subdivisions. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger. Discrete & Computational Geometry (24): 721-733 (2000). Web SearchBibTeXDownload
81Kinetic connectivity for unit disks. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang. Symposium on Computational Geometry 2000, 331-340. Web SearchBibTeXDownload
1999
80Data Structures for Mobile Data. Julien Basch, Leonidas J. Guibas, John Hershberger. J. Algorithms (31): 1-28 (1999). Web SearchBibTeXDownload
79An Optimal Algorithm for Euclidean Shortest Paths in the Plane. John Hershberger, Subhash Suri. SIAM J. Comput. (28): 2215-2256 (1999). Web SearchBibTeXDownload
78Kinetic Collision Detection Between Two Simple Polygons. Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang. SODA 1999, 102-111. Web SearchBibTeXDownload
77Kinetic Data Structures: Animating Proofs Through Time. Julien Basch, Joăo Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang. Symposium on Computational Geometry 1999, 427-428. Web SearchBibTeXDownload
76Lower Bounds for Kinetic Planar Subdivisions. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger. Symposium on Computational Geometry 1999, 247-254. Web SearchBibTeXDownload
75Kinetic Connectivity of Rectangles. John Hershberger, Subhash Suri. Symposium on Computational Geometry 1999, 237-246. Web SearchBibTeXDownload
1998
74Practical methods for approximating shortest paths on a convex polytope in R3. John Hershberger, Subhash Suri. Comput. Geom. (10): 31-46 (1998). Web SearchBibTeXDownload
73Erased arrangements of lines and convex decompositions of polyhedra. John Hershberger, Jack Snoeyink. Comput. Geom. (9): 129-143 (1998). Web SearchBibTeXDownload
72Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. John Hershberger, Jack Snoeyink. Comput. Geom. (11): 175-185 (1998). Web SearchBibTeXDownload
1997
71Finding a Shortest Diagonal of a Simple Polygon in Linear Time. John Hershberger, Subhash Suri. Comput. Geom. (7): 149-160 (1997). Web SearchBibTeXDownload
70Matrix Searching with the Shortest-Path Metric. John Hershberger, Subhash Suri. SIAM J. Comput. (26): 1612-1634 (1997). Web SearchBibTeXDownload
69Data Structures for Mobile Data. Julien Basch, Leonidas J. Guibas, John Hershberger. SODA 1997, 747-756. Web SearchBibTeXDownload
68Snap Rounding Line Segments Efficiently in Two and Three Dimensions. Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum. Symposium on Computational Geometry 1997, 284-293. Cited by 52Web SearchBibTeXDownload
67Efficient Breakout Routing in Printed Circuit Boards. John Hershberger, Subhash Suri. Symposium on Computational Geometry 1997, 460-462. Web SearchBibTeXDownload
66Maintaining the Extent of a Moving Point Set. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach. WADS 1997, 31-44. Web SearchBibTeXDownload
65Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). John Hershberger, Subhash Suri. WADS 1997, 462-471. Web SearchBibTeXDownload
64Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. John Hershberger, Jack Snoeyink. WADS 1997, 93-103. Web SearchBibTeXDownload
1996
63Off-Line Maintenance of Planar Configurations. John Hershberger, Subhash Suri. J. Algorithms (21): 453-475 (1996). Web SearchBibTeXDownload
62Efficiently Planning Compliant Motion in the Plane. Joseph Friedman, John Hershberger, Jack Snoeyink. SIAM J. Comput. (25): 562-599 (1996). Web SearchBibTeXDownload
1995
61The Centroid of Points with Approximate Weights. Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter. ESA 1995, 460-472. Web SearchBibTeXDownload
60Optimal parallel algorithms for triangulated simple polygons. John Hershberger. Int. J. Comput. Geometry Appl. (5): 145-170 (1995). Web SearchBibTeXDownload
59A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. John Hershberger, Subhash Suri. J. Algorithms (18): 403-431 (1995). Web SearchBibTeXDownload
58Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. John Hershberger, Subhash Suri. SODA 1995, 447-456. Web SearchBibTeXDownload
57Morphing Binary Trees. John Hershberger, Subhash Suri. SODA 1995, 396-404. Web SearchBibTeXDownload
56Practical Methods for Approximating Shortest Paths on a Convex Polytope in R³. John Hershberger, Subhash Suri. SODA 1995, 447-456. Web SearchBibTeX
1994
55Ray Shooting in Polygons Using Geodesic Triangulations. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. Algorithmica (12): 54-68 (1994). Web SearchBibTeXDownload
54An Efficient Solution to the Zookeeper's Problem. John Hershberger, Jack Snoeyink. CCCG 1994, 104-109. Web SearchBibTeX
53Computing Minimum Length Paths of a Given Homotopy Class. John Hershberger, Jack Snoeyink. Comput. Geom. (4): 63-97 (1994). Web SearchBibTeXDownload
52Selecting Heavily Covered Points. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. SIAM J. Comput. (23): 1138-1151 (1994). Web SearchBibTeXDownload
51An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification. John Hershberger, Jack Snoeyink. Symposium on Computational Geometry 1994, 383-384. Web SearchBibTeXDownload
50Morphing Simple Polygons. Leonidas J. Guibas, John Hershberger, Subhash Suri. Symposium on Computational Geometry 1994, 267-276. Web SearchBibTeXDownload
49Data Structures for Two-Edge Connectivity in Planar Graphs. John Hershberger, Monika Rauch, Subhash Suri. Theor. Comput. Sci. (130): 139-161 (1994). Cited by 6Web SearchBibTeXDownload
1993
48An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink. Algorithmica (10): 1-23 (1993). Web SearchBibTeXDownload
47Computing the Intersection-Depth of Polyhedra. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. Algorithmica (9): 518-533 (1993). Web SearchBibTeXDownload
46Efficient Computation of Euclidean Shortest Paths in the Plane. John Hershberger, Subhash Suri. FOCS 1993, 508-517. Web SearchBibTeXDownload
45A Faster Algorithm for the Two-Center Decision Problem. John Hershberger. Inf. Process. Lett. (47): 23-29 (1993). Web SearchBibTeXDownload
44Approximating Polygons and Subdivisions with Minimum Link Paths. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink. Int. J. Comput. Geometry Appl. (3): 383-415 (1993). Web SearchBibTeXDownload
43A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. John Hershberger, Subhash Suri. SODA 1993, 54-63. Web SearchBibTeXDownload
42Matrix searching with the shortest path metric. John Hershberger, Subhash Suri. STOC 1993, 485-494. Web SearchBibTeXDownload
41Compliant Motion in a Simple Polygon. John Hershberger, John Hershberger, Jack Snoeyink. Symposium on Computational Geometry 1993, 397-398. Web SearchBibTeXDownload
1992
40Applications of a Semi-Dynamic Convex Hull Algorithm. John Hershberger, Subhash Suri. BIT (32): 249-267 (1992). Web SearchBibTeX
39Upper Envelope Onion Peeling. John Hershberger. Comput. Geom. (2): 93-110 (1992). Web SearchBibTeXDownload
38Minimizing the Sum of Diameters Efficiently. John Hershberger. Comput. Geom. (2): 111-118 (1992). Web SearchBibTeXDownload
37Color and Sound in Algorithmic Animation. Marc H. Brown, John Hershberger. IEEE Computer (25): 52-63 (1992). Web SearchBibTeXDownload
36Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. John Hershberger, Jack Snoeyink. SWAT 1992, 376-387. Web SearchBibTeXDownload
35Fully Dynamic 2-Edge-Connectivity in Planar Graphs. John Hershberger, Monika Rauch, Subhash Suri. SWAT 1992, 233-244. Cited by 19Web SearchBibTeXDownload
34Optimal Parallel Algorithms for Triangulated Simple Polygons. John Hershberger. Symposium on Computational Geometry 1992, 33-42. Web SearchBibTeXDownload
1991
33Ray Shooting in Polygons Using Geodesic Triangulations. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. ICALP 1991, 661-646. Web SearchBibTeXDownload
32A New Data Structure for Shortest Path Queries in a Simple Polygon. John Hershberger. Inf. Process. Lett. (38): 231-235 (1991). Web SearchBibTeXDownload
31Compact interval trees: a data structure for convex hulls. Leonidas J. Guibas, John Hershberger, Jack Snoeyink. Int. J. Comput. Geometry Appl. (1): 1-22 (1991). Web SearchBibTeXDownload
30Approximating Polygons and Subdivisions with Minimum Link Paths. Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink. ISA 1991, 151-162. Web SearchBibTeXDownload
29Finding Tailored Partitions. John Hershberger, Subhash Suri. J. Algorithms (12): 431-463 (1991). Web SearchBibTeXDownload
28Offline Maintenance of Planar Configurations. John Hershberger, Subhash Suri. SODA 1991, 32-41. Web SearchBibTeXDownload
27Color and Sound in Algorithm Animation. Marc H. Brown, John Hershberger. VL 1991, 10-17. Web SearchBibTeX
26Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). John Hershberger, Jack Snoeyink. WADS 1991, 331-342. Web SearchBibTeXDownload
1990
25Implicitly Searching Convolutions and Computing Depth of Collision. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. SIGAL International Symposium on Algorithms 1990, 165-180. Web SearchBibTeXDownload
24Compact Interval Trees: A Data Structure for Convex Hulls. Leonidas J. Guibas, John Hershberger, Jack Snoeyink. SODA 1990, 169-178. Web SearchBibTeXDownload
23Applications of a Semi-Dynamic Convex Hull Algorithm. John Hershberger, Subhash Suri. SWAT 1990, 380-392. Web SearchBibTeXDownload
22Upper Envelope Onion Peeling. John Hershberger. SWAT 1990, 368-379. Web SearchBibTeXDownload
21Input-Sensitive Compliant Motion in the Plane. Joseph Friedman, John Hershberger, Jack Snoeyink. SWAT 1990, 225-237. Web SearchBibTeXDownload
20Slimming Down by Adding: Selecting Heavily Covered Points. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. Symposium on Computational Geometry 1990, 116-127. Web SearchBibTeXDownload
1989
19An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons. John Hershberger. Algorithmica (4): 141-155 (1989). Web SearchBibTeXDownload
18Implicitly Representing Arrangements of Lines or Segments. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. Discrete & Computational Geometry (4): 433-466 (1989). Web SearchBibTeXDownload
17On Arrangement of Jordan Arcs with Three Intersection per Pair. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Discrete & Computational Geometry (4): 523-539 (1989). Web SearchBibTeXDownload
16Finding the Upper Envelope of n Line Segments in O(n log n) Time. John Hershberger. Inf. Process. Lett. (33): 169-174 (1989). Web SearchBibTeXDownload
15Optimal Shortest Path Queries in a Simple Polygon. Leonidas J. Guibas, John Hershberger. J. Comput. Syst. Sci. (39): 126-152 (1989). Web SearchBibTeXDownload
14Compliant Motion in a Simple Polygon. John Hershberger, John Hershberger, Jack Snoeyink. Symposium on Computational Geometry 1989, 175-186. Web SearchBibTeXDownload
13Finding Tailored Partitions. John Hershberger, Subhash Suri. Symposium on Computational Geometry 1989, 255-265. Web SearchBibTeXDownload
12Sweeping Arrangements of Curves. Jack Snoeyink, John Hershberger. Symposium on Computational Geometry 1989, 354-363. Web SearchBibTeXDownload
1988
11An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. John Hershberger, Leonidas J. Guibas. J. Algorithms (9): 18-46 (1988). Web SearchBibTeXDownload
10An efficient algorithm for finding the CSG representation of a simple polygon. David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink. SIGGRAPH 1988, 31-40. Web SearchBibTeXDownload
9Implicitly Representing Arrangements of Lines or Segments. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. Symposium on Computational Geometry 1988, 56-69. Web SearchBibTeXDownload
8On Arrangements of Jordan Arcs with Three Intersections per Pair. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Symposium on Computational Geometry 1988, 258-265. Web SearchBibTeXDownload
1987
7Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. Algorithmica (2): 209-233 (1987). Web SearchBibTeXDownload
6Optimal Shortest Path Queries in a Simple Polygon. Leonidas J. Guibas, John Hershberger. Symposium on Computational Geometry 1987, 50-63. Web SearchBibTeXDownload
5Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size. John Hershberger. Symposium on Computational Geometry 1987, 11-20. Web SearchBibTeXDownload
1986
4Visibility of Disjoint Polygons. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. Algorithmica (1): 49-63 (1986). Web SearchBibTeXDownload
3Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. Symposium on Computational Geometry 1986, 1-13. Web SearchBibTeXDownload
1985
2Computing the visibility graphs of n line segments in O(nn) time. Leonidas J. Guibas, John Hershberger. Bulletin of the EATCS (26): 13-20 (1985). Web SearchBibTeX
1Visibility-Polygon Search and Euclidean Shortest Paths. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. FOCS 1985, 155-164. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research