Convex Hulls of Spatial Polygons with a Fixed Convex Projection

نویسنده

  • Boris V. Dekster
چکیده

Let F be a convex n-gon in a horizontal plane of the Euclidean 3-space. Consider its spatial variation under which its vertices move vertically and let F be the convex hull of such a variation. In the general position, the boundary of F splits naturally into the "bottom" F 0 and the "top" F 00. The polyhedron F 0 (F 00) has triangular faces and no vertices inside. The projection of these faces on F yields a triangulation T 0 (T 00) of F. Obviously T 0 and (T 00) have no common diagonals. Suppose now that T 0 and (T 00) with no common diagonals are prescribed. Guibas conjectured that the appropriate variation exists. The present paper gives a suucient and a necessary condition of such existence. The necessary condition can fail which disproves the Guibas conjecture. MSC91: 52B10 A segment connecting two vertices of a at convex polygon and crossing its interior will be called a diagonal. Let F be a convex n{gon with no 3 vertices collinear. By a diagonal triangulation T of F, we will mean a nonempty set of its diagonals which do not intersect in intF and split F into triangles. One can see easily that these triangles are nondegenerate and their number is n ? 2, where n is necessarily 4. We will call them triangles of T.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersection of Nonconvex Polygons Using the Alternate Hierarchical Decomposition

Intersection computation is one of the fundamental operations of computational geometry. This paper presents an algorithm for intersection computation between two polygons (convex/nonconvex, with nonintersecting edges, and with or without holes). The approach is based on the decomposed representation of polygons, alternate hierarchical decomposition (AHD), that decomposes the nonconvex polygon ...

متن کامل

On the X-Y Convex Hull of a Set of X-Y Polygons

We study the class of rectilinear polygons, called X Y polygons, with horizontal and vertical edges, which are frequently used as building blocks for very large-scale integrated (VLSI) circuit layout and wiring. In the paper we introduce the notion of convexity within the.~class of X Y polygons and present efficient algorithms for computing the X Y convex hulls of an X Y polygon and of a set of...

متن کامل

Experimental Evaluation of Filter Effectiveness

Evaluation of a spatial join typically has two steps: a filter step that applies the join on approximations of spatial objects and a refinement step that determines the actual intersection of two spatial objects. In this paper, we study the effectiveness of filters with different approximations including minimum bounding rectangles, rectilinear approximations, minimum 5-corner bounding convex p...

متن کامل

Inner-Cover of Non-Convex Shapes

Visibility methods are often based on the existence of large convex occluders. We present an algorithm that for a given simple non-convex polygon P finds an approximate inner-cover by large convex polygons. The algorithm is based on an initial partitioning of P into a set C of disjoint convex polygons which are an exact tessellation of P . The algorithm then builds a set of large convex polygon...

متن کامل

Existence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials 

Introduction Let  be a nonempty subset of a normed linear space . A self-mapping  is said to be nonexpansive provided that  for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995