| Select a publication |
| Show |
Title |
Venue |
Rating |
Date |
|
Conference paper
John Hershberger.
Stable snap rounding.
|
Comput. Geom. 2013, Volume 46 |
(0)
|
2013 |
|
Conference paper
John Hershberger.
Guest Editor's Foreword.
|
Discrete Computational Geometry 2011, Volume 45 |
(0)
|
2011 |
|
Conference paper
Luca Foschini, John Hershberger, Subhash Suri.
On the Complexity of Time-Dependent Shortest Paths.
|
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011 |
(0)
|
2011 |
|
Conference paper
John Hershberger.
Stable snap rounding.
|
Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011 2011 |
(0)
|
2011 |
|
Conference paper
Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri.
The Union of Probabilistic Boxes: Maintaining the Volume.
|
Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings 2011 |
(0)
|
2011 |
|
Conference paper
Irene Finocchi, John Hershberger.
Guest editors' foreword.
|
ACM Journal of Experimental Algorithmics 2011, Volume 16 |
(0)
|
2011 |
|
Conference paper
Hakan Yildiz, John Hershberger, Subhash Suri.
A Discrete and Dynamic Version of Klee's Measure Problem.
|
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011 2011 |
(0)
|
2011 |
|
Conference paper
Daniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun.
Road Network Reconstruction for Organizing Paths.
|
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010 |
(0)
|
2010 |
|
Conference paper
John Hershberger, Subhash Suri.
Simplified Planar Coresets for Data Streams.
|
Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings 2008 |
(0)
|
2008 |
|
Conference paper
John Hershberger, Subhash Suri.
Adaptive sampling for geometric problems over data streams.
|
Comput. Geom. 2008, Volume 39 |
(0)
|
2008 |
|
Conference paper
John Hershberger.
Improved Output-Sensitive Snap Rounding.
|
Discrete Computational Geometry 2008, Volume 39 |
(0)
|
2008 |
|
Conference paper
John Hershberger, Nisheeth Shrivastava, Subhash Suri.
Summarizing spatial data streams using ClusterHulls.
|
ACM Journal of Experimental Algorithmics 2008, Volume 13 |
(0)
|
2008 |
|
Conference paper
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic, John Hershberger.
Sparse data aggregation in sensor networks.
|
Proceedings of the 6th International Conference on Information Processing in Sensor Networks, IPSN 2007, Cambridge, Massachusetts, USA, April 25-27, 2007 2007 |
(0)
|
2007 |
|
Conference paper
Sorabh Gandhi, John Hershberger, Subhash Suri.
Approximate isocontours and spatial summaries for sensor networks.
|
Proceedings of the 6th International Conference on Information Processing in Sensor Networks, IPSN 2007, Cambridge, Massachusetts, USA, April 25-27, 2007 2007 |
(0)
|
2007 |
|
Conference paper
John Hershberger, Subhash Suri, Amit M. Bhosle.
On the difficulty of some shortest path problems.
|
ACM Transactions on Algorithms 2007, Volume 3 |
(0)
|
2007 |
|
Conference paper
John Hershberger, Matthew Maxel, Subhash Suri.
Finding the
|
ACM Transactions on Algorithms 2007, Volume 3 |
(0)
|
2007 |
|
Conference paper
John Hershberger, Nisheeth Shrivastava, Subhash Suri.
Summarizing Spatial Data Streams Using ClusterHulls.
|
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, ALENEX 2006, Miami, Florida, USA, January 21, 2006 2006 |
(0)
|
2006 |
|
Conference paper
John Hershberger.
Improved output-sensitive snap rounding.
|
Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006 2006 |
(0)
|
2006 |
|
Conference paper
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri.
Contour Approximation in Sensor Networks.
|
Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, San Francisco, CA, USA, June 18-20, 2006, Proceedings 2006 |
(0)
|
2006 |
|
Conference paper
John Hershberger, Nisheeth Shrivastava, Subhash Suri.
Cluster Hull: A Technique for Summarizing Spatial Data Streams.
|
Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA 2006 |
(0)
|
2006 |
|
Conference paper
John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth.
Adaptive Spatial Partitioning for Multidimensional Data Streams.
|
Algorithmica 2006, Volume 46 |
(0)
|
2006 |
|
Conference paper
John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth.
Space complexity of hierarchical heavy hitters in multi-dimensional data streams.
|
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 13-15, 2005, Baltimore, Maryland, USA 2005 |
(0)
|
2005 |
|
Conference paper
Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink.
Polygonal path simplification with angle constraints.
|
Comput. Geom. 2005, Volume 32 |
(0)
|
2005 |
|
Conference paper
John Hershberger.
Smooth kinetic maintenance of clusters.
|
Comput. Geom. 2005, Volume 31 |
(0)
|
2005 |
|
Conference paper
Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu.
Geometric spanners for routing in mobile networks.
|
IEEE Journal on Selected Areas in Communications 2005, Volume 23 |
(0)
|
2005 |
|
Conference paper
John Hershberger, Subhash Suri, Csaba D. Tóth.
Binary Space Partitions of Orthogonal Subdivisions.
|
SIAM J. Comput. 2004, Volume 34 |
(0)
|
2005 |
|
Conference paper
John Hershberger, Subhash Suri, Csaba D. Tóth.
Binary space partitions of orthogonal subdivisions.
|
Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 2004 |
(0)
|
2004 |
|
Conference paper
Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang.
Fractionally cascaded information in a sensor network.
|
Proceedings of the Third International Symposium on Information Processing in Sensor Networks, IPSN 2004, Berkeley, California, USA, April 26-27, 2004 2004 |
(0)
|
2004 |
|
Conference paper
John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth.
Adaptive Spatial Partitioning for Multidimensional Data Streams.
|
Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings 2004 |
(0)
|
2004 |
|
Conference paper
John Hershberger, Subhash Suri.
Adaptive Sampling for Geometric Problems over Data Streams.
|
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France 2004 |
(0)
|
2004 |
|
Conference paper
Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang.
Kinetic collision detection between two simple polygons.
|
Comput. Geom. 2004, Volume 27 |
(0)
|
2004 |
|
Conference paper
John Hershberger.
Kinetic collision detection with fast flight plan changes.
|
Inf. Process. Lett. 2004, Volume 92 |
(0)
|
2004 |
|
Conference paper
John Hershberger, Matthew Maxel, Subhash Suri.
Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation.
|
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, January 11, 2003 2003 |
(0)
|
2003 |
|
Conference paper
John Hershberger.
Smooth kinetic maintenance of clusters.
|
Proceedings of the 19th ACM Symposium on Computational Geometry, June 8-10, 2003, San Diego, CA, USA 2003 |
(0)
|
2003 |
|
Conference paper
John Hershberger, Subhash Suri.
Binary space partitions for 3D subdivisions.
|
SODA 2003 |
(0)
|
2003 |
|
Conference paper
John Hershberger, Subhash Suri, Amit M. Bhosle.
On the Difficulty of Some Shortest Path Problems.
|
STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings 2003 |
(0)
|
2003 |
|
Conference paper
Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu.
Discrete Mobile Centers.
|
Discrete Computational Geometry 2003, Volume 30 |
(0)
|
2003 |
|
Conference paper
John Hershberger, Subhash Suri.
Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?".
|
43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings 2002 |
(0)
|
2002 |
|
Conference paper
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. 2002, Volume 34 |
(0)
|
2002 |
|
Conference paper
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang.
Deformable Free-Space Tilings for Kinetic Collision Detection.
|
I. J. Robotic Res. 2002, Volume 21 |
(0)
|
2002 |
|
Conference paper
Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu.
Discrete mobile centers.
|
Symposium on Computational Geometry 2001 |
(0)
|
2001 |
|
Conference paper
John Hershberger, Subhash Suri.
Vickrey Prices and Shortest Paths: What is an Edge Worth?.
|
FOCS 2001 |
(0)
|
2001 |
|
Conference paper
Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu.
Geometric spanner for routing in mobile networks.
|
Proceedings of the 2nd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2001, October 4-5, 2001, Long Beach, CA, USA 2001 |
(0)
|
2001 |
|
Conference paper
Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink.
Polygonal path approximation with angle constraints.
|
SODA 2001 |
(0)
|
2001 |
|
Conference paper
John Hershberger, Subhash Suri.
Simplified kinetic connectivity for rectangles and hypercubes.
|
SODA 2001 |
(0)
|
2001 |
|
Conference paper
Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach.
Maintaining the Extent of a Moving Point Set.
|
Discrete Computational Geometry 2001, Volume 26 |
(0)
|
2001 |
|
Conference paper
Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang.
Kinetic Connectivity for Unit Disks.
|
Discrete Computational Geometry 2001, Volume 25 |
(0)
|
2001 |
|
Conference paper
John Hershberger.
Guest Editor's Foreword - Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, Minnesota, June 1998.
|
Int. J. Comput. Geometry Appl. 2001, Volume 11 |
(0)
|
2001 |
|
Conference paper
Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang.
Kinetic connectivity for unit disks.
|
Symposium on Computational Geometry 2000 |
(0)
|
2000 |
|
Conference paper
Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger.
Lower Bounds for Kinetic Planar Subdivisions.
|
Discrete Computational Geometry 2000, Volume 24 |
(0)
|
2000 |
|
Conference paper
Leonidas J. Guibas, John Hershberger, Subhash Suri.
Morphing Simple Polygons.
|
Discrete Computational Geometry 2000, Volume 24 |
(0)
|
2000 |
|
Conference paper
Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger.
Lower Bounds for Kinetic Planar Subdivisions.
|
Symposium on Computational Geometry 1999 |
(0)
|
1999 |
|
Conference paper
Julien Basch, João Luiz Dihl Comba, Leonidas J. Guibas, John Hershberger, Craig Silverstein, Li Zhang.
Kinetic Data Structures: Animating Proofs Through Time.
|
Symposium on Computational Geometry 1999 |
(0)
|
1999 |
|
Conference paper
John Hershberger, Subhash Suri.
Kinetic Connectivity of Rectangles.
|
Symposium on Computational Geometry 1999 |
(0)
|
1999 |
|
Conference paper
Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang.
Kinetic Collision Detection Between Two Simple Polygons.
|
SODA 1999 |
(0)
|
1999 |
|
Conference paper
Julien Basch, Leonidas J. Guibas, John Hershberger.
Data Structures for Mobile Data.
|
J. Algorithms 1999, Volume 31 |
(0)
|
1999 |
|
Conference paper
John Hershberger, Subhash Suri.
An Optimal Algorithm for Euclidean Shortest Paths in the Plane.
|
SIAM J. Comput. 1999, Volume 28 |
(0)
|
1999 |
|
Conference paper
John Hershberger, Jack Snoeyink.
Erased arrangements of lines and convex decompositions of polyhedra.
|
Comput. Geom. 1998, Volume 9 |
(0)
|
1998 |
|
Conference paper
John Hershberger, Jack Snoeyink.
Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time.
|
Comput. Geom. 1998, Volume 11 |
(0)
|
1998 |
|
Conference paper
John Hershberger, Subhash Suri.
Practical methods for approximating shortest paths on a convex polytope in R3.
|
Comput. Geom. 1998, Volume 10 |
(0)
|
1998 |
|
Conference paper
Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum.
Snap Rounding Line Segments Efficiently in Two and Three Dimensions.
|
Symposium on Computational Geometry 1997 |
(0)
|
1997 |
|
Conference paper
John Hershberger, Subhash Suri.
Efficient Breakout Routing in Printed Circuit Boards.
|
Symposium on Computational Geometry 1997 |
(0)
|
1997 |
|
Conference paper
Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach.
Maintaining the Extent of a Moving Point Set.
|
Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings 1997 |
(0)
|
1997 |
|
Conference paper
John Hershberger, Jack Snoeyink.
Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time.
|
Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings 1997 |
(0)
|
1997 |
|
Conference paper
John Hershberger, Subhash Suri.
Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract).
|
Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings 1997 |
(0)
|
1997 |
|
Conference paper
John Hershberger, Subhash Suri.
Finding a Shortest Diagonal of a Simple Polygon in Linear Time.
|
Comput. Geom. 1997, Volume 7 |
(0)
|
1997 |
|
Conference paper
John Hershberger, Subhash Suri.
Matrix Searching with the Shortest-Path Metric.
|
SIAM J. Comput. 1997, Volume 26 |
(0)
|
1997 |
|
Conference paper
Julien Basch, Leonidas J. Guibas, John Hershberger.
Data Structures for Mobile Data.
|
SODA 1997 |
(0)
|
1997 |
|
Conference paper
John Hershberger, Subhash Suri.
Off-Line Maintenance of Planar Configurations.
|
J. Algorithms 1996, Volume 21 |
(0)
|
1996 |
|
Conference paper
Joseph Friedman, John Hershberger, Jack Snoeyink.
Efficiently Planning Compliant Motion in the Plane.
|
SIAM J. Comput. 1996, Volume 25 |
(0)
|
1996 |
|
Conference paper
Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter.
The Centroid of Points with Approximate Weights.
|
Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings 1995 |
(0)
|
1995 |
|
Conference paper
John Hershberger.
Optimal parallel algorithms for triangulated simple polygons.
|
Int. J. Comput. Geometry Appl. 1995, Volume 5 |
(0)
|
1995 |
|
Conference paper
John Hershberger, Subhash Suri.
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk.
|
J. Algorithms 1995, Volume 18 |
(0)
|
1995 |
|
Conference paper
John Hershberger, Subhash Suri.
Morphing Binary Trees.
|
SODA 1995 |
(0)
|
1995 |
|
Conference paper
John Hershberger, Subhash Suri.
Practical Methods for Approximating Shortest Paths on a Convex Polytope in R
|
SODA 1995 |
(0)
|
1995 |
|
Conference paper
John Hershberger, Jack Snoeyink.
An Efficient Solution to the Zookeeper's Problem.
|
CCCG 1994 |
(0)
|
1994 |
|
Conference paper
Leonidas J. Guibas, John Hershberger.
Morphing Simple Polygons.
|
Symposium on Computational Geometry 1994 |
(0)
|
1994 |
|
Conference paper
John Hershberger, Jack Snoeyink.
An O(n log n) Implementation of the Douglas-Peucker Algorithm for Line Simplification.
|
Symposium on Computational Geometry 1994 |
(0)
|
1994 |
|
Conference paper
Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink.
Ray Shooting in Polygons Using Geodesic Triangulations.
|
Algorithmica 1994, Volume 12 |
(0)
|
1994 |
|
Conference paper
John Hershberger, Jack Snoeyink.
Computing Minimum Length Paths of a Given Homotopy Class.
|
Comput. Geom. 1994, Volume 4 |
(0)
|
1994 |
|
Conference paper
Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir.
Selecting Heavily Covered Points.
|
SIAM J. Comput. 1994, Volume 23 |
(0)
|
1994 |
|
Conference paper
John Hershberger, Monika Rauch Henzinger, Subhash Suri.
Data Structures for Two-Edge Connectivity in Planar Graphs.
|
Theor. Comput. Sci. 1994, Volume 130 |
(0)
|
1994 |
|
Conference paper
John Hershberger.
Compliant Motion in a Simple Polygon.
|
Symposium on Computational Geometry 1993 |
(0)
|
1993 |
|
Conference paper
John Hershberger, Subhash Suri.
Efficient Computation of Euclidean Shortest Paths in the Plane
|
34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993 1993 |
(0)
|
1993 |
|
Conference paper
John Hershberger, Subhash Suri.
Matrix searching with the shortest path metric.
|
STOC 1993 |
(0)
|
1993 |
|
Conference paper
David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink.
An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon.
|
Algorithmica 1993, Volume 10 |
(0)
|
1993 |
|
Conference paper
David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri.
Computing the Intersection-Depth of Polyhedra.
|
Algorithmica 1993, Volume 9 |
(0)
|
1993 |
|
Conference paper
Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink.
Approximating Polygons and Subdivisions with Minimum Link Paths.
|
Int. J. Comput. Geometry Appl. 1993, Volume 3 |
(0)
|
1993 |
|
Conference paper
John Hershberger.
A Faster Algorithm for the Two-Center Decision Problem.
|
Inf. Process. Lett. 1993, Volume 47 |
(0)
|
1993 |
|
Conference paper
John Hershberger, Subhash Suri.
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk.
|
SODA 1993 |
(0)
|
1993 |
|
Conference paper
John Hershberger.
Optimal Parallel Algorithms for Triangulated Simple Polygons.
|
Symposium on Computational Geometry 1992 |
(0)
|
1992 |
|
Conference paper
John Hershberger, Monika Rauch Henzinger, Subhash Suri.
Fully Dynamic 2-Edge-Connectivity in Planar Graphs.
|
Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings 1992 |
(0)
|
1992 |
|
Conference paper
John Hershberger, Jack Snoeyink.
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra.
|
Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings 1992 |
(0)
|
1992 |
|
Conference paper
John Hershberger, Subhash Suri.
Applications of a Semi-Dynamic Convex Hull Algorithm.
|
BIT 1992, Volume 32 |
(0)
|
1992 |
|
Conference paper
John Hershberger.
Upper Envelope Onion Peeling.
|
Comput. Geom. 1992, Volume 2 |
(0)
|
1992 |
|
Conference paper
John Hershberger.
Minimizing the Sum of Diameters Efficiently.
|
Comput. Geom. 1992, Volume 2 |
(0)
|
1992 |
|
Conference paper
Marc H. Brown, John Hershberger.
Color and Sound in Algorithmic Animation.
|
IEEE Computer 1992, Volume 25 |
(0)
|
1992 |
|
Conference paper
Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink.
Ray Shooting in Polygons Using Geodesic Triangulations.
|
Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings 1991 |
(0)
|
1991 |
|
Conference paper
Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink.
Approximating Polygons and Subdivisions with Minimum Link Paths.
|
ISA '91 Algorithms, 2nd International Symposium on Algorithms, Taipei, Republic of China, December 16-18, 1991, Proceedings 1991 |
(0)
|
1991 |
|
Conference paper
Marc H. Brown, John Hershberger.
Color and Sound in Algorithm Animation.
|
VL 1991 |
(0)
|
1991 |