In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paper is concerned with the visibility of a simple polygon from one of its edges. Three natural definitions of the visibility of a polygon from an edge are presented. The following computational problem ...

Let G denote a graph and let K be a subset of vertices that are a set of target vertices of G. The Kterminal reliability of G is defined as the probability that all target vertices in K are connected, considering the possible failures of non-target vertices of G. The problem of computing K-terminal reliability is known to be #P-complete for polygon-circle graphs, and can be solved in polynomial...

In this paper we present a.n efficient pa.ra.Ilel algorithm. for polygon tria.ngu.Ia.tion. The algo-rithm we present runs in O(logn) time using D(n) processors, which is optimal if the polygon is allowed to contain holes. This improves the previous parallel complexity bounds for this problem by a log n factor. If we are also given a trapezoidal decomposition of the polygon as input, then we can...

Based on building polygons (building footprints) on a digital map, we are proposing a GIS (Geographic Information System) and CG integrated system to generate 3-D building models automatically. Most building polygons‟ edges meet at right angles (orthogonal polygon). A complicated orthogonal polygon can be partitioned into a set of rectangles. In order to partition an orthogonal polygon, we prop...

Triangulation of polygon is of very importance in three-dimensional software applications. An algorithm for triangulation of polygon based on binary space-partitioning (BSP) tree idea is proposed in this paper. That is, this algorithm implements triangulation of poly-gon with recursive method according to BSP tree structure. It is suitable for not only simple polygons with arbitrary convex or c...