Paul J. Heffernan

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1998

Two-Guard Walkability of Simple Polygons.

L. H. Tseng, Paul J. Heffernan, D. T. Lee

Int. J. Comput. Geom. Appl., 1998

1997

LR-visibility in Polygons.

Gautam Das, Paul J. Heffernan, Giri Narasimhan

Comput. Geom., 1997

1996

Constructing Degree-3 Spanners with Other Sparseness Properties.

Gautam Das, Paul J. Heffernan

Int. J. Found. Comput. Sci., 1996

An optimal algorithm for the two-guard problem.

Paul J. Heffernan

Int. J. Comput. Geom. Appl., 1996

1995

An Optimal Algorithm for Computing Visibility in the Plane.

Paul J. Heffernan, Joseph S. B. Mitchell

SIAM J. Comput., 1995

1994

Finding all Weakly-Visible Chords of a Polygon in Linear Time.

Gautam Das, Paul J. Heffernan, Giri Narasimhan

Nord. J. Comput., 1994

Approximate Decision Algorithms for Point Set Congruence.

Paul J. Heffernan, Stefan Schirra

Comput. Geom., 1994

Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract).

Gautam Das, Paul J. Heffernan, Giri Narasimhan

Proceedings of the Algorithm Theory, 1994

1993

Linear-time Algorithms for Weakly-monotone Polygons.

Paul J. Heffernan

Comput. Geom., 1993

Generalized Approzimate Algorithms for Point Set Congruence.

Paul J. Heffernan

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Optimally Sparse Spanners in 3-Dimensional Euclidean Space.

Gautam Das, Paul J. Heffernan, Giri Narasimhan

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1991

The Translation Square Map and Approximate Congruence.

Paul J. Heffernan

Inf. Process. Lett., 1991

1990

Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract).

Paul J. Heffernan, Joseph S. B. Mitchell

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990