Search the dblp DataBase
Paul J. Heffernan :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Gautam Das , Paul J. Heffernan , Giri Narasimhan LR-visibility in Polygons. [Citation Graph (0, 0)][DBLP ] CCCG, 1993, pp:303-308 [Conf ] Gautam Das , Paul J. Heffernan , Giri Narasimhan Optimally Sparse Spanners in 3-Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:53-62 [Conf ] Paul J. Heffernan An Optimal Algorithm for the Two-Guard Problem. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:348-358 [Conf ] Paul J. Heffernan , Joseph S. B. Mitchell Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1990, pp:53-62 [Conf ] Paul J. Heffernan , Stefan Schirra Approximate Decision Algorithms for Point Set Congruence. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1992, pp:93-101 [Conf ] Gautam Das , Paul J. Heffernan Constructing Degree-3 Spanners with Other Sparseness Properties. [Citation Graph (0, 0)][DBLP ] ISAAC, 1993, pp:11-20 [Conf ] Gautam Das , Paul J. Heffernan , Giri Narasimhan Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1994, pp:119-130 [Conf ] Paul J. Heffernan Generalized Approzimate Algorithms for Point Set Congruence. [Citation Graph (0, 0)][DBLP ] WADS, 1993, pp:373-384 [Conf ] Paul J. Heffernan , Joseph S. B. Mitchell An Optimal Algorithm for Computing Visibility in the Plane. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:437-448 [Conf ] Gautam Das , Paul J. Heffernan , Giri Narasimhan LR-visibility in Polygons. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:7, n:, pp:37-57 [Journal ] Paul J. Heffernan Linear-time Algorithms for Weakly-monotone Polygons. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1993, v:3, n:, pp:121-137 [Journal ] Paul J. Heffernan , Stefan Schirra Approximate Decision Algorithms for Point Set Congruence. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1994, v:4, n:, pp:137-156 [Journal ] Paul J. Heffernan An optimal algorithm for the two-guard problem. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:15-44 [Journal ] L. H. Tseng , Paul J. Heffernan , D. T. Lee Two-Guard Walkability of Simple Polygons. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1998, v:8, n:1, pp:85-116 [Journal ] Gautam Das , Paul J. Heffernan Constructing Degree-3 Spanners with Other Sparseness Properties. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:121-136 [Journal ] Paul J. Heffernan The Translation Square Map and Approximate Congruence. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:39, n:3, pp:153-159 [Journal ] Gautam Das , Paul J. Heffernan , Giri Narasimhan Finding all Weakly-Visible Chords of a Polygon in Linear Time. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1994, v:1, n:4, pp:433-457 [Journal ] Paul J. Heffernan , Joseph S. B. Mitchell An Optimal Algorithm for Computing Visibility in the Plane. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:1, pp:184-201 [Journal ] Search in 0.004secs, Finished in 0.005secs