Consider a set of circles of the same length and r irregular polygons with vertices on a circle of this length. Each of the polygons has to be arranged on a given subset of all circles and the positions of the polygon on the different circles are depending on each other. How should the polygons be arranged relative to each other to minimize some criterion function depending on the distances bet...

The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a simple algorithm for drawing the straight skeleton of a monotone polygon. The time and space complexities of our algorithm are O(nlogn) and O(n) respectively.

The article provides a set of algorithms for performing set operations on polygonal regions in the plane using standard oating point arithmetic. The algorithms are robust, guaranteeing both topological consistency and numerical accuracy. Each polygon edge is modeled as an implicit or explicit polygonal curve which stays within some distance of the original line segment. If the curve is implicit...

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