Document Sample

Advanced Topics in Computational and Combinatorial Geometry Assignment 1 (short answers and hints) 1) a) It is easy to see that each such �������� is a Davenport-Schinzel sequence of order 2. Notice that the size of each �������� is 2���� ‒ 3 . Since λ2(���� ‒ 1) = 2���� ‒ 3 we can conclude that �������� is of maximum length. b) First notice that the last appearing symbol in a DS sequence of order 2 appears only once. Also if ���� is the last symbol then a maximal sequence looks locally like [����][����][����]. Now using induction we construct a polygon for the sequence without the [����][����] part. Now add new vertex named [n+1], connect it to 0 and ����. Reconnect vertex [n] only to the vertices that are after the [n-1] symbol and before the [n] symbol. Connect the [n+1] vertex to all the vertices that are after the [n+1] symbol. c) see this: www.math.nmsu.edu/hist_projects/catalan.ps ( you need to download some program to see postscript files) 2) For ���� = 6. for larger ���� this is done similarly. 1213141515432626364656 of length 5*6-8 3) a) First, construct the lower envelope of all the �������� . Total complexity so far: λ���� + 2(����). Now write the x-value of all the critical points on the lower envelope of the separate ��������'s. we get a total of λ���� + 2(����) such x-values. Consider these x-values: ‒ ∞ < ����1 < ����2 < ����3 < … < �������� < ∞ . Between any two consecutive x-values: �������� < �������� + 1 there are only c different functions, one from each collection, that can attain the envelope, so the number of new critical points created from intersections between them is at most O(1). Thus the total complexity is ����(λ���� + 2(����)). b) The construction of the lower envelope for each �������� takes λ���� + 1(��������)������������(��������) time. Merging the sorted x-value lists for each �������� into one big x-value list for all ��������'s takes ����(λ���� + 2(����)) time. Constructing the additional O(1) points over each interval takes O(1) time, and in total ����(λ���� + 2(����)). Thus the algorithm takes λ���� + 1(����)������������(����) time. c) Here q=1 thus λ3(����). 4) a) For each point define the slope function, ��������, of that point (meaning the slope from that point to 0) as a function of time, t. Each �������� is defined on half of the real line ���� and each pair intersect at most twice. It is easy to that the complexity of the upper envelope of such a collection is λ2 + 1(����) = λ3(����) (use problem 3). b) There are 3 types of discrete changes to the upper boundary of the convex hull around a vertex u: 1) the edge from u to the left changes its other endpoint. 2) the edge from u to the right changes its other endpoint. 3) u stops/starts being a vertex of the convex hull. The number of changes of type 1,2 is λ3(����). The number of changes of type 3 is also λ3(����) (again using combination like in problem 3). Total: O( λ3(����)) at one vertex, so a total of O( ����λ3(����)) changes. 5) Change the coordinates from Cartesian to polar. The union becomes the upper envelope. The intersection becomes the lower envelope. These new functions are defined on [0,2π), the combinatorial complexity of both (union and intersection) is bounded by λ4(����).

DOCUMENT INFO

Shared By:

Categories:

Tags:

Stats:

views: | 0 |

posted: | 1/1/2014 |

language: | Unknown |

pages: | 2 |

OTHER DOCS BY qingyunliuliu

How are you planning on using Docstoc?
BUSINESS
PERSONAL

By registering with docstoc.com you agree to our
privacy policy and
terms of service, and to receive content and offer notifications.

Docstoc is the premier online destination to start and grow small businesses. It hosts the best quality and widest selection of professional documents (over 20 million) and resources including expert videos, articles and productivity tools to make every small business better.

Search or Browse for any specific document or resource you need for your business. Or explore our curated resources for Starting a Business, Growing a Business or for Professional Development.

Feel free to Contact Us with any questions you might have.