Paul J. Heffernan

According to our database1, Paul J. Heffernan authored at least 13 papers between 1990 and 1998.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1998
Two-Guard Walkability of Simple Polygons.
Int. J. Comput. Geom. Appl., 1998

1994
Finding all Weakly-Visible Chords of a Polygon in Linear Time.
Nord. J. Comput., 1994

Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

1993
Linear-time Algorithms for Weakly-monotone Polygons.
Comput. Geom., 1993

Generalized Approzimate Algorithms for Point Set Congruence.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Constructing Degree-3 Spanners with Other Sparseness Properties.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

An Optimal Algorithm for the Two-Guard Problem.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Optimally Sparse Spanners in 3-Dimensional Euclidean Space.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

LR-visibility in Polygons.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Approximate Decision Algorithms for Point Set Congruence.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
The Translation Square Map and Approximate Congruence.
Inf. Process. Lett., 1991

An Optimal Algorithm for Computing Visibility in the Plane.
Proceedings of the Algorithms and Data Structures, 1991

1990
Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990


  Loading...