DOIAbstract
AbstractSimple polygons can be made convex by a finite number of flips, or of flipturns. These results are extended to very general polygons
AbstractSimple polygons can be made convex by a finite number of flips, or of flipturns. These results are extended to very general polygons
AbstractWe introduce a notion of k-convexity and explore polygons in the plane that have this proper...
We show that the triangulations of a finite point set form a flip graph that can be embedded isometr...
Given a polygon P, a ipturn involves re ecting a pocket p of P through the midpoint of the lid of p...
Given a polygon P, a flipturn involves reflecting a pocket p of P through the midpoint of the lid of...
A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, b...
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex....
AbstractGiven a simple polygon in the plane, a flip is defined as follows: consider the convex hull ...
AbstractA diagonal flip is an operation that converts one triangulation of a convex polygon into ano...
To convexify a polygon is to reconfigure it with respect to a given set of operations until the poly...
We show that any simple n-vertex polygon can be made convex, without losing internal visibilities be...
peer reviewedWe explore several families of flip-graphs, all related to polygons or punctured polygo...
Flipping is a local and efficient operation to construct the convex hull in an incremental fashion. ...
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns ...
We introduce a notion of k-convexity and explore some properties of polygons that have this property...
Given a simple polygon in the plane, a ip is de ned as follows: consider the convex hull of the poly...
AbstractWe introduce a notion of k-convexity and explore polygons in the plane that have this proper...
We show that the triangulations of a finite point set form a flip graph that can be embedded isometr...
Given a polygon P, a ipturn involves re ecting a pocket p of P through the midpoint of the lid of p...
Given a polygon P, a flipturn involves reflecting a pocket p of P through the midpoint of the lid of...
A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, b...
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex....
AbstractGiven a simple polygon in the plane, a flip is defined as follows: consider the convex hull ...
AbstractA diagonal flip is an operation that converts one triangulation of a convex polygon into ano...
To convexify a polygon is to reconfigure it with respect to a given set of operations until the poly...
We show that any simple n-vertex polygon can be made convex, without losing internal visibilities be...
peer reviewedWe explore several families of flip-graphs, all related to polygons or punctured polygo...
Flipping is a local and efficient operation to construct the convex hull in an incremental fashion. ...
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns ...
We introduce a notion of k-convexity and explore some properties of polygons that have this property...
Given a simple polygon in the plane, a ip is de ned as follows: consider the convex hull of the poly...
AbstractWe introduce a notion of k-convexity and explore polygons in the plane that have this proper...
We show that the triangulations of a finite point set form a flip graph that can be embedded isometr...
Given a polygon P, a ipturn involves re ecting a pocket p of P through the midpoint of the lid of p...
Add to ORKG