Characterizing and efficiently computing quadrangulations of planar point sets
نویسندگان
چکیده
Given a set S of n points in the plane, a quadrangulation of S is a planar subdivision whose vertices are the points of S, whose outer face is the convex hull of S, and every face of the subdivision (except possibly the outer face) is a quadrilateral. We show that S admits a quadrangulation if and only if S does not have an odd number of extreme points. If S admits a quadrangulation, we present an algorithm that computes a quadrangulation of S in O(n logn) time even in the presence of collinear points. If S does not admit a quadrangulation, then our algorithm can quadrangulate S with the addition of one extra point, which is optimal. We also provide an (n logn) time lower bound for the problem. Our results imply that a k-angulation of a set of points can be achieved with the addition of at most k 3 extra points within the same time bound. Finally, we present an experimental comparison between three quadrangulation algorithms which shows that the Spiraling Rotating Calipers (SRC) algorithm (presented in Section 4) produces quadrangulations with the greatest number of convex quadrilaterals as well as those with the smallest difference between the average minimum and maximum angle over all quadrangles.
منابع مشابه
Experimental results on quadrangulations of sets of fixed points
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if possible and as “fat” or squarish as possible. For a given set of points a quadrangulation, if it exists, may not admit all its quadrilaterals to be convex. In such cases we desire that the quadrangulations have as many convex q...
متن کاملThe three-point function of planar quadrangulations
We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple universal scaling function, which is the continuous three-point function of pure 2D quantum gravity. We give explicit expressions for this universal threepoint fu...
متن کاملA bijection for triangulations, quadrangulations, pentagulations, etc
A d-angulation is a planar map with faces of degree d. We present for each integer d ≥ 3 a bijection between the class of d-angulations of girth d and a class of decorated plane trees. Each of the bijections is obtained by specializing a “master bijection” which extends an earlier construction of the first author. Bijections already existed for triangulations (d = 3) and for quadrangulations (d...
متن کاملQuadrangulations of Planar Sets
A linear-time algorithm for decomposing recti-linear star-shaped polygons into convex quadrilaterals, " Proc.
متن کاملComputing convex quadrangulations☆
We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 14 شماره
صفحات -
تاریخ انتشار 1997