On Hamiltonian polygons
نویسندگان
چکیده
منابع مشابه
On Hamiltonian Triangulations in Simple Polygons
An n-vertex simple polygon P is said to have a Hamiltonian Triangulation if it has a triangulation whose dual graph contains a hamiltonian path. Such triangulations are useful in fast rendering engines in Computer Graphics. We give a new characterization of polygons with hamiltonian triangulations and use it to devise O(n logn)-time algorithms to recognize such polygons. We also give eecient al...
متن کاملHamiltonian Triangulations and Circumscribing Polygons
Let Σ = { S1 , . . . , Sn } be a finite set of disjoint line segments in the plane. We conjecture that its visibility graph, Vis(Σ), is hamiltonian. In fact, we make the stronger conjecture that Vis(Σ) has a hamiltonian cycle whose embedded version is a simple polygon (i.e., its boundary edges are non-crossing visibility segments). We call such a simple polygon a spanning polygon of Σ. Existenc...
متن کاملHamiltonian Evolutions of Twisted Polygons in Rp
In this paper we find a discrete moving frame and their associated invariants along projective polygons in RP, and we use them to describe invariant evolutions of projective N -gons. We then apply a reduction process to obtain a natural Hamiltonian structure on the space of projective invariants for polygons, establishing a close relationship between the projective N -gon invariant evolutions a...
متن کاملOn k-convex polygons
We introduce a notion of k-convexity and explore polygons in the plane that have this property. Polygons which are k-convex can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem. We give a characterization of 2-convex polygons, a particularly interesting class, and show how to recognize them in O(n log n) time. A description of their sh...
متن کاملOn convex lattice polygons
Let II be a convex lattice polygon with b boundary points and c (5 1) interior points. We show that for any given a , the number b satisfies b 5 2e + 7 , and identify the polygons for which equality holds. A lattice polygon II is a simple polygon whose vertices are points of the integral lattice. We let A = 4(11) denote the area of II , b{U) the number of lattice points on the boundary of II , ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1976
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90031-9