A Rectilinearity Measurement for Polygons

نویسندگان

  • Jovisa D. Zunic
  • Paul L. Rosin
چکیده

In this paper we define a function R(P ) which is defined for any polygon P and which maps a given polygon P into a number from the interval (0, 1]. The number R(P ) can be used as an estimate of the rectilinearity of P . The mapping R(P ) has the following desirable properties: – any polygon P has the estimated rectilinearity R(P ) which is a number from (0, 1]; – R(P )=1 if and only if P is a rectilinear polygon, i.e., all interior angles of P belong to the set {π/2, 3π/2}; – inf P∈Π R(P ) = 0, where Π denotes the set of all polygons; – a polygon’s rectilinearity measure is invariant under similarity transformations. A simple procedure for computing R(P ) for a given polygon P is described as well.

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

ثبت نام

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

منابع مشابه

Measuring rectilinearity

Two new methods for computing the rectilinearity of polygons are presented. They provide shape measures and estimates of canonical orientations which can be used in applications such as shape retrieval, object classification, image segmentation, etc. Examples are presented demonstrating their use in skew correction of scanned documents, deprojection of aerial photographs of buildings, and scale...

متن کامل

Rectilinear Edge Selectivity Is Insufficient to Explain the Category Selectivity of the Parahippocampal Place Area

The parahippocampal place area (PPA) is one of several brain regions that respond more strongly to scenes than to non-scene items such as objects and faces. The mechanism underlying this scene-preferential response remains unclear. One possibility is that the PPA is tuned to low-level stimulus features that are found more often in scenes than in less-preferred stimuli. Supporting this view, Nas...

متن کامل

Rectilinearity Measurements for Polygons

The paper introduces a shape measure intended to describe the extent to which a closed polygon is rectilinear. Other than somewhat obvious measures of rectilinearity (e.g. the sum of the differences of each corner’s angle from 90◦) there has been little work in deriving a measure that is straightforward to compute, is invarient under scale and translation, and corresponds with the intuitive not...

متن کامل

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...

متن کامل

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,...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2002