#### Filter Results:

#### Publication Year

2007

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. " Ruler Folding Problem " , which is NP-Complete is to find the minimum length of the folded chain. The best linear approximation algorithm for it were proposed by Hopcroft et al. Their… (More)

The Steiner problem leads to solutions in several scientific and business applications. Computer networks routing and electronic integrated circuits are few examples of it. Assuming some points in the Euclidean plane, we can construct a minimum spanning tree connecting these (terminal) nodes. It is possible to add some extra points (Steiner Points) in order… (More)

The minimum Steiner tree problem, a classical combinatorial optimization problem with a long history, is a NP-complete problem. Due to its wide application, study of heuristic algorithm about Steiner tree problem has important practical and theoretical significance. In this paper, we introduce a new heuristic algorithm based on Sollin's algorithm for… (More)

The shape reconstruction problem is one of important and most applied problems in many branches of computer science. In this paper a new method is introduced which a graph as output and work on boundary samples as input, in the plan. The proposed method starts reconstruction from the random polygon production on input points and by calculating the Euclidean… (More)

The minimum Steiner tree problem, a classical combinatorial optimization problem with a long history, is a NP-complete problem. Due to its wide application, study of heuristic algorithm about Steiner tree problem has important practical and theoretical significance. In this paper we first review one of the existing algorithms for solving the Steiner problem… (More)

Pseudo-triangulation is regarded as one of the most commonly used problems in computational geometry. In this paper we consider the problem of minimum pseudo-triangulation of a given set of points S in the plane using convex hull layers and we propose two new methods that will lead to the production of minimum pseudo-triangulation. This means that the… (More)

- A. Nourollah
- 2011

and computational geometry is the generation of random polygons. practical evaluation of algorithms that operate on polygons, where it is necessary to check determine the actual CPU experimentally. To this time, no polynomial known for the random generation of polygons with a uniform distribution presented for generating random polygons using a set of… (More)

The generation of random simple polygon and the pseudo-triangulation of a polygon are regarded as the proposed problems in computational geometry. The production of a random polygon is used in the context of the consideration of the accuracy of algorithms. In this paper, a new algorithm is presented to generate a simple spiral polygon on a set of random… (More)