Graham triangulations and triangulations with a center are hamiltonean

Authors:
Ruy Fabila Monroy;J. Urrutia
Affiliations:
Facultad de Ciencias, Universidad Nacionál Autónoma de México, México D.F., Mexico;Instituto de Matemáticas, Universidad Nacionál Autónoma de México, México D.F., Mexico
Venue:
Information Processing Letters
Year:
2005

Citing 3
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Time/space tradeoffs for polygon mesh rendering

ACM Transactions on Graphics (TOG)
No Quadrangulation is Extremely Odd

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let P be a point set with n elements in general position. A triangulation T of P is a set of triangles with disjoint interiors such that their union is the convex hull of P, no triangle contains an element of P in its interior, and the vertices of the triangles of T are points of P. Given T we define a graph G(T) whose vertices are the triangles of T, two of which are adjacent if they share an edge. We say that T is hamiltonean if G(T) has a hamiltonean path. We prove that the triangulations produced by Graham's Scan are hamiltonean. Furthermore we prove that any triangulation T of a point set which has a point adjacent to all the points in P (a center of T) is hamiltonean.