In this rst installment of a two-part paper, the underlying theory for an algorithm that computes the Voronoi diagram and medial axis of a planar domain bounded by free-form (polynomial or rational) curve segments is presented. An incremental approach to computing the Voronoi diagram is used, wherein a single boundary segment is added to an existingâ€¦ (More)

Details of algorithms to construct the Voronoi diagrams and medial axes of planars domain bounded by free-form (polynomial or rational) curve segments are presented, based on theoretical foundations given in the rst installment Ramamurthy and Farouki, J. Comput. Appl. Math. (1999) 102 119â€“141 of this two-part paper. In particular, we focus on keyâ€¦ (More)

T 1 onto these lightpaths. The switching granulari-ties of the nodes 1, 2, 3, and 4 are STS-1, OC-3, STS-1, and STS-1, respectively. The capacity of a wavelength channel is OC-12 for this illustration. Figure 1(a) shows the switching state of the OXCs. Since the switching granularity of node 2 (OC-3) is coarser than the bandwidth granularity of the trafficâ€¦ (More)