The Flip Diameter of Rectangulations and Convex Subdivisions
نویسندگان
چکیده
We study the configuration space of rectangulations and convex subdivisions of n points in the plane. It is shown that a sequence of O(n log n) elementary flip and rotate operations can transform any rectangulation to any other rectangulation on the same set of n points. This bound is the best possible for some point sets, while Θ(n) operations are sufficient and necessary for others. Some of our bounds generalize to convex subdivisions of n points in the plane.
منابع مشابه
A Note on Flips in Diagonal Rectangulations
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal with local changes involving a single edge of a rectangulation, referred to as flips, edge rotations, or edge pivoting. Such operations induce a graph on equi...
متن کاملSimultaneous edge flips for convex subdivisions
It has been shown that one triangulation of a set of points can be converted to any other triangulation of the same set of points by a sequence of edge flip operations. In this paper we consider a tesselation of a set of points consisting of convex cells, a convex subdivision, and explore the notion of flipping edges from one convex subdivision of the points to another, where both subdivisions ...
متن کاملBinary search trees and rectangulations
We revisit the classical problem of searching in a binary search tree (BST) using rotations, and present novel connections of this problem to a number of geometric and combinatorial structures. In particular, we show that the execution trace of a BST that serves a sequence of queries is in close correspondence with the flip-sequence between two rectangulations. (Rectangulations are well-studied...
متن کاملFlipping edge-labelled triangulations
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique labels to the triangulation edges. We introduce the concept of the orbit of an edge e, which is the set of all edges reachable from e via flips. We establish the...
متن کاملA result on flip - graph connectivity
A polyhedral subdivision of a d-dimensional point configuration A is k-regular if it is projected from the boundary complex of a polytope with dimension at most d+k. Call γk(A) the subgraph induced by k-regular triangulations in the flip-graph of A. Gel’fand, Kapranov, and Zelevinsky have shown that γ1(A) is connected. It is established here that γ2(A) is connected as well. 1. Flip-graph connec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 18 شماره
صفحات -
تاریخ انتشار 2014