Question
In class we argued that the number of parabolic arcs along the beach line in Fortune's algorithm is at most 2n ? 1. The goal
In class we argued that the number of parabolic arcs along the beach line in Fortune's algorithm is at most 2n ? 1. The goal of this problem is to prove this result in a somewhat more general setting. Consider the beach line at some stage of the computation, and let {p1, . . . , pn} denote the sites that have been processed up to this point in time. Label each arc of the beach line with its associated site. Reading the labels from left to right defines a string. (In Figure 3 below, the string would be p3p2p1p2p4p6p7p8p6p3)
(a) Prove that for any i, j, the following alternating subsequence cannot appear anywhere within such a string: . . . pi . . . pj . . . pi . . . pj . . .
(b) Prove that any string of n distinct symbols that does not contain any repeated symbols (. . . pipi . . .) and does not contain the alternating sequence of the type given in part (a) cannot be of length greater than 2n ? 1. (Hint: Use induction on n.)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started