# Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon

##### Citations

56 citations

^{1}, University of Nevada, Reno

^{2}, University of Warsaw

^{3}, University of Liverpool

^{4}

22 citations

##### References

688 citations

506 citations

407 citations

### "Computing a Hamiltonian Path of Min..." refers background in this paper

...In this regard, we refer the reader to Guibas and Hershberger [19] and Hershberger [21] for full details (cf. also Mitchell [24] for an excellent and comprehensive review concerning shortest paths in computational geometry)....

[...]

...also Mitchell [24] for an excellent and comprehensive review concerning shortest paths in computational geometry)....

[...]

349 citations

### "Computing a Hamiltonian Path of Min..." refers background or methods in this paper

...tions of scheme (9) when W satisfies monotonicity properties can be found in Galil and Giancarlo [14], Aggarwal and Park [2], García and Tejel [16], García et al....

[...]

...Perhaps the best-known is the one developed by Larmore and Schieber [23], which we call the LARSCH algorithm (see, for instance, Galil and Park [15] for another algorithm and also Bar-Noy et al. [7] for other types of on-line and off-line versions)....

[...]

...where E[2] = d(p1,p2), E[k] is computed from E[k] and L(k) according to (4), for k = 3, ....

[...]

...It is also interesting to mention that the notions of two-dimensional totally monotone arrays, as well as Monge arrays, were generalized by Aggarwal and Park [1] to multidimensional arrays (cf. also Park [26])....

[...]

...Applications of scheme (9) when W satisfies monotonicity properties can be found in Galil and Giancarlo [14], Aggarwal and Park [2], García and Tejel [16], García et al. [17], among others, together with the aforementioned papers [3, 15, 22, 23]....

[...]

321 citations