2018
DOI: 10.12783/dtcse/csae2017/17489
|View full text |Cite
|
Sign up to set email alerts
|

An Algorithm for Computing a Hamiltonian Cycle of Given Points in a Polygonal Region

Abstract: In this paper, for a point set X in a simple polygon P, we present an algorithm to compute a Hamiltonian cycle which avoids the boundary of P and accesses all points of X. Computing a Hamiltonian cycle of given points in a simple polygon is a novel transformation of the general Hamiltonian problems and the problem of finding simple paths on given obstacles in a simple polygon. In our solution, we first construct the geodesic convex hull G of X inside P, and then find simple paths turn only at the points of X f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 11 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?