A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ then the graph is called polygonal. We introduce a method for constructing near-polygonal graphs with 2-arc transitive automorphism groups. As special cases, we obtain several new infinite families of polygonal gr...

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...

We consider polygonal Markov fields originally introduced by Arak and Surgailis [1, 2]. Our attention is focused on fields with nodes of order two, which can be regarded as continuum ensembles of non-intersecting contours in the plane, sharing a number of salient features with the two-dimensional Ising model. The purpose of this paper is to establish an explicit stochastic representation for th...

  SUMMARY Scolicidal agents are used by most surgeons during operations for hydatid cysts when these agents are injected into the cys t cavity, they can pass through the communicating passages between the cyst and bile ducts into the large intrahepatic and extrahepatic bile ducts and because of their caustic nature, they have the potential to damage the epithelium of ducts. This epithelial da...