On the Order on a Special Polygon

نویسندگان

  • Andrzej Trybulec
  • Yatsuka Nakamura
چکیده

One can prove the following propositions: (1) For all sets A, B, C, p such that A ∩ B ⊆ {p} and p ∈ C and C misses B holds A ∪ C misses B. (2) For all sets A, B, C, p such that A ∩ C = {p} and p ∈ B and B ⊆ C holds A ∩ B = {p}. (3) For all sets A, B such that for every set y such that y ∈ B holds A misses y holds A misses ⋃ B. (4) For all sets A, B such that for all sets x, y such that x ∈ A and y ∈ B holds x misses y holds ⋃ A misses ⋃ B.

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

ثبت نام

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

منابع مشابه

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

An application of geometrical isometries in non-planar molecules

In this paper we introduce a novel methodology to transmit the origin to the center of a polygon in a molecule structure such that the special axis be perpendicular to the plane containing the polygon. The mathematical calculation are described completely and the algorithm will be showed as a computer program.

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

Identification of adapted genotypes in sesame lines based on multi-trait selection

Identification of genotypes adapted to a particular region is of special interest to breeders and plant geneticists. In order to identify adapted genotypes in sesame lines based on multi-trait selection, an experiment was conducted in a completely randomized block design with four replications at Moghan Agricultural Research Station of Ardabil Agricultural and Natural Resources Research and Edu...

متن کامل

Special Guards in Chromatic Art Gallery

We present two new versions of the chromatic art gallery problem that can improve upper bound of the required colors pretty well. In our version, we employ restricted angle guards so that these modern guards can visit α-degree of their surroundings. If α is between 0 and 180 degree, we demonstrate that the strong chromatic guarding number is constant. Then we use orthogonal 90-degree guards for...

متن کامل

Divided differences of inverse functions and partitions of a convex polygon

We derive a formula for an n-th order divided difference of the inverse of a function. The formula has a simple and surprising structure: it is a sum over partitions of a convex polygon with n+1 vertices. The formula provides a numerically stable method of computing divided differences of k-th roots. It also provides a new way of enumerating all partitions of a convex polygon of a certain type,...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2004