1998 |
18 | | 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 |
17 | | Gautam Das,
Paul J. Heffernan,
Giri Narasimhan:
LR-visibility in Polygons.
Comput. Geom. 7: 37-57 (1997) |
1996 |
16 | | Paul J. Heffernan:
An optimal algorithm for the two-guard problem.
Int. J. Comput. Geometry Appl. 6(1): 15-44 (1996) |
15 | | Gautam Das,
Paul J. Heffernan:
Constructing Degree-3 Spanners with Other Sparseness Properties.
Int. J. Found. Comput. Sci. 7(2): 121-136 (1996) |
1995 |
14 | | 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 |
13 | | Gautam Das,
Paul J. Heffernan,
Giri Narasimhan:
Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract).
SWAT 1994: 119-130 |
12 | | Paul J. Heffernan,
Stefan Schirra:
Approximate Decision Algorithms for Point Set Congruence.
Comput. Geom. 4: 137-156 (1994) |
11 | | 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) |
1993 |
10 | | Gautam Das,
Paul J. Heffernan,
Giri Narasimhan:
LR-visibility in Polygons.
CCCG 1993: 303-308 |
9 | | Gautam Das,
Paul J. Heffernan:
Constructing Degree-3 Spanners with Other Sparseness Properties.
ISAAC 1993: 11-20 |
8 | EE | Paul J. Heffernan:
An Optimal Algorithm for the Two-Guard Problem.
Symposium on Computational Geometry 1993: 348-358 |
7 | EE | Gautam Das,
Paul J. Heffernan,
Giri Narasimhan:
Optimally Sparse Spanners in 3-Dimensional Euclidean Space.
Symposium on Computational Geometry 1993: 53-62 |
6 | | Paul J. Heffernan:
Generalized Approzimate Algorithms for Point Set Congruence.
WADS 1993: 373-384 |
5 | | Paul J. Heffernan:
Linear-time Algorithms for Weakly-monotone Polygons.
Comput. Geom. 3: 121-137 (1993) |
1992 |
4 | EE | Paul J. Heffernan,
Stefan Schirra:
Approximate Decision Algorithms for Point Set Congruence.
Symposium on Computational Geometry 1992: 93-101 |
1991 |
3 | | Paul J. Heffernan,
Joseph S. B. Mitchell:
An Optimal Algorithm for Computing Visibility in the Plane.
WADS 1991: 437-448 |
2 | | Paul J. Heffernan:
The Translation Square Map and Approximate Congruence.
Inf. Process. Lett. 39(3): 153-159 (1991) |
1990 |
1 | EE | 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 |