Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in the number of surrounding cycles. As a consequence, we can l...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Author:	Eppstein, David
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 01.03.2023
Subjects:	Algorithms Computational geometry Convexity Polynomials
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!