Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the firs...
Let T be a triangulation of a set P of n points in the plane, and let e be an edge shared by two tri...
Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every triang...
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, an...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled tria...
Flips in triangulations have received a lot of attention over the past decades. However, the problem...
Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert ...
We review results concerning edge flips in triangulations concentrating mainly on various aspects of...
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm ...
In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—...
This paper studied the geometric and combinatorial aspects of the classical Lawsons flip algorithm [...
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. W...
AbstractIt will be shown that any two triangulations on a closed surface, except the sphere, with mi...
Let T be a triangulation of a set P of n points in the plane, and let e be an edge shared by two tri...
Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every triang...
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, an...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a c...
This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled tria...
Flips in triangulations have received a lot of attention over the past decades. However, the problem...
Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert ...
We review results concerning edge flips in triangulations concentrating mainly on various aspects of...
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm ...
In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—...
This paper studied the geometric and combinatorial aspects of the classical Lawsons flip algorithm [...
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. W...
AbstractIt will be shown that any two triangulations on a closed surface, except the sphere, with mi...
Let T be a triangulation of a set P of n points in the plane, and let e be an edge shared by two tri...
Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every triang...
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, an...