Finding a Shortest Hamiltonian Path inside a Simple Polygon

(1993) Finding a Shortest Hamiltonian Path inside a Simple Polygon. J. of Information Processing Letters, 55. pp. 75-79.

[img]
Preview
HTML
distransform.pdf

Download (200kB) | Preview
[img]
Preview
PDF
distransform.pdf

Download (200kB) | Preview
Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Information and Computer Science
Depositing User: MOHAMMAD HAMAD AL-SUWAIYEL
Date Deposited: 25 Jun 2008 12:03
Last Modified: 01 Nov 2019 14:03
URI: https://eprints.kfupm.edu.sa/id/eprint/10646