| 1998 | ||
|---|---|---|
| j9 | L. H. Tseng, Paul J. Heffernan, D. T. Lee: Two-Guard Walkability of Simple Polygons. Int. J. Comput. Geometry Appl. 8(1): 85-116 (1998) | |
| 1997 | ||
| j8 | Gautam Das, Paul J. Heffernan, Giri Narasimhan: LR-visibility in Polygons. Comput. Geom. 7: 37-57 (1997) | |
| 1996 | ||
| j7 | Paul J. Heffernan: An optimal algorithm for the two-guard problem. Int. J. Comput. Geometry Appl. 6(1): 15-44 (1996) | |
| j6 | Gautam Das, Paul J. Heffernan: Constructing Degree-3 Spanners with Other Sparseness Properties. Int. J. Found. Comput. Sci. 7(2): 121-136 (1996) | |
| 1995 | ||
| j5 | Paul J. Heffernan, Joseph S. B. Mitchell: An Optimal Algorithm for Computing Visibility in the Plane. SIAM J. Comput. 24(1): 184-201 (1995) | |
| 1994 | ||
| j4 | Paul J. Heffernan, Stefan Schirra: Approximate Decision Algorithms for Point Set Congruence. Comput. Geom. 4: 137-156 (1994) | |
| j3 | Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding all Weakly-Visible Chords of a Polygon in Linear Time. Nord. J. Comput. 1(4): 433-457 (1994) | |
| c9 | Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). SWAT 1994: 119-130 | |
| 1993 | ||
| j2 | Paul J. Heffernan: Linear-time Algorithms for Weakly-monotone Polygons. Comput. Geom. 3: 121-137 (1993) | |
| c8 | ||
| c7 | Gautam Das, Paul J. Heffernan, Giri Narasimhan: Optimally Sparse Spanners in 3-Dimensional Euclidean Space. Symposium on Computational Geometry 1993: 53-62 | |
| c6 | Paul J. Heffernan: An Optimal Algorithm for the Two-Guard Problem. Symposium on Computational Geometry 1993: 348-358 | |
| c5 | Gautam Das, Paul J. Heffernan: Constructing Degree-3 Spanners with Other Sparseness Properties. ISAAC 1993: 11-20 | |
| c4 | ||
| 1992 | ||
| c3 | Paul J. Heffernan, Stefan Schirra: Approximate Decision Algorithms for Point Set Congruence. Symposium on Computational Geometry 1992: 93-101 | |
| 1991 | ||
| j1 | Paul J. Heffernan: The Translation Square Map and Approximate Congruence. Inf. Process. Lett. 39(3): 153-159 (1991) | |
| c2 | Paul J. Heffernan, Joseph S. B. Mitchell: An Optimal Algorithm for Computing Visibility in the Plane. WADS 1991: 437-448 | |
| 1990 | ||
| c1 | Paul J. Heffernan, Joseph S. B. Mitchell: Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract). Symposium on Computational Geometry 1990: 53-62 | |
| 1 | Gautam Das | |
| 2 | D. T. Lee (Der-Tsai Lee) | |
| 3 | Joseph S. B. Mitchell | |
| 4 | Giri Narasimhan | |
| 5 | Stefan Schirra | |
| 6 | L. H. Tseng |
Data released under the ODC-BY 1.0 license — See also our legal information page