Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal S
Clipping to the boundary of a circular-arc polygon
โ Scribed by Christopher J. Van Wyk
- Publisher
- Elsevier Science
- Year
- 1984
- Weight
- 650 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0734-189X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A family of arcs on a circle is proper if no arc is properly contained within another. While general minimal arc coloring is NP-complete, Orlin et al. recently obtained on O(n') algorithm for q-coloring a proper family of arcs by modeling proper arc coloring as a shortest path problem in an associat
The problem considered is that of the heat transfer occurring at the inlet to a circular tube. Using the method of a previous paper we solve the energy equation ill the form of a power series, instead of transforming the equation into an eigenvalue problem by separation of variables, as is usual in
good agreement is achieved. Comparisons of the dispersion characteristics with those of hollow, partially filled, and fully filled dielectric waveguides are also considered, and several interesting remarks are given. lNTRODuCTl0~ ## James p. 430j has pointed out that ''there is a lack of readily
A simple exact solution for estimating the location of the center of a circular arc and its radius is suggested. Its features are demonstrated with the help of a computer program.