Recognition and Representation of a Hierarchy of Polygons with Holes

نویسندگان

  • G. H. KIRBY
  • M. VISVALINGAM
چکیده

Polygons with holes must be handled in digital cartography, 2D and 3D modelling, image analysis and picture generation. The Dissassociative Area Model (DAM) described in this paper uses polygonal units of uncut space, termed primitive regions, in the representation of the geometric and topoiogical properties of a set of areal entities. Algorithms and a data structure are presented which extract boundaries of these polygons from vector data and determine their topology. The algorithms recognise the containment hierarchy of polygons with holes without the need for information relating to the areal entities. The hierarchy is represented by a rooted tree of boundaries, rather than regions, and does not involve bridges between inner and outer boundaries.

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

ثبت نام

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

منابع مشابه

Recognition and Representation of Hierarchy of Polygons with Holes

Polygons with holes must be handled in digital cartography, 2D and 3D modelling, image analysis and picture generation. The Dissassociative Area Model (DAM) described in this paper uses polygonal units of uncut space, termed primitive regions, in the representation of the geometric and topoiogical properties of a set of areal entities. Algorithms and a data structure are presented which extract...

متن کامل

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

متن کامل

A New IRIS Segmentation Method Based on Sparse Representation

Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...

متن کامل

A New IRIS Segmentation Method Based on Sparse Representation

Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2008