Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Homework Assignment: Section of Triangulation

    Uploaded by

    Henrique Mariano Amaral
    This document contains 8 homework exercises on computational geometry topics: 1) Proving an upper bound on the number of edges intersected by a line avoiding point vertices in a triangulation. 2) Showing edges of Euclidean minimum spanning trees belong to the Delaunay triangulation of the same point set. 3) Proving triangulations with only acute triangles are Delaunay triangulations.

    Copyright:

    © All Rights Reserved
    Download as PS, PDF, TXT or read online from Scribd

    Homework Assignment: Section of Triangulation

    Uploaded by

    Henrique Mariano Amaral
    10 views1 page
    This document contains 8 homework exercises on computational geometry topics: 1) Proving an upper bound on the number of edges intersected by a line avoiding point vertices in a triangulation. 2) Showing edges of Euclidean minimum spanning trees belong to the Delaunay triangulation of the same point set. 3) Proving triangulations with only acute triangles are Delaunay triangulations.

    Original Title

    E-I.ps

    Copyright

    © © All Rights Reserved

    Available Formats

    PS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 8 homework exercises on computational geometry topics: 1) Proving an upper bound on the number of edges intersected by a line avoiding point vertices in a triangulation. 2) Showing edges of Euclidean minimum spanning trees belong to the Delaunay triangulation of the same point set. 3) Proving triangulations with only acute triangles are Delaunay triangulations.

    Copyright:

    © All Rights Reserved
    Download as PS, PDF, TXT or read online from Scribd
    Download as ps, pdf, or txt
    10 views1 page

    Homework Assignment: Section of Triangulation

    Uploaded by

    Henrique Mariano Amaral
    This document contains 8 homework exercises on computational geometry topics: 1) Proving an upper bound on the number of edges intersected by a line avoiding point vertices in a triangulation. 2) Showing edges of Euclidean minimum spanning trees belong to the Delaunay triangulation of the same point set. 3) Proving triangulations with only acute triangles are Delaunay triangulations.

    Copyright:

    © All Rights Reserved
    Download as PS, PDF, TXT or read online from Scribd
    Download as ps, pdf, or txt
    of 1

    Exercise Collection I

    February 2, 1999

    Homework Assignment
    The solution for each question should t on one side of a single piece of paper.

    1. Section of triangulation. Let K be a triangulation of a set of n points in the plane. Let ` be a


    line that avoids all point. Prove that ` intersects at
    most 2n 4 edges of K and that this upper bound
    is tight for every n  3.

    vector of angles,
    v(K ) = ( 1  2  : : :  3t):
    Let L be another triangulation of the same point
    set and call L smaller than or equal to K if v(L) =
    v(K ) or v(L) is lexicographically smaller than
    v(K ). Prove that all triangulations are smaller
    than or equal to the Delaunay triangulation.
    6. Minmax circumcircle. Let K be a triangulation
    of a nite set in the plane and let %(K ) be the
    radius of the largest circumcircle of any triangle in
    K . Prove %(K )  %(D), where D is the Delaunay
    triangulation of the set.
    7. Random permutation. Show that the following
    algorithm constructs a random permutation of the
    integers 1 through n.

    2. Minimum spanning tree. The notion of minimum spanning tree can be extended from weighted
    graphs to a geometric setting where the nodes are
    points in the plane. Take the complete graph of
    the set of nodes and de ne the length of an edge
    as the Euclidean distance between its endpoints.
    A minimum spanning tree of that graph is a Euclidean minimum spanning tree of the point set.
    Prove that all edges of every Euclidean minimum
    spanning tree belong to the Delaunay triangulation
    of the same point set.
    3. Acute triangles. An acute triangle has all three
    angles less than 2 . Note that a Delaunay triangle
    abc is acute i the dual Voronoi vertex is contained
    in the interior of abc. Show that a triangulation K
    all of whose triangles are acute is necessarily the
    Delaunay triangulation of its vertex set.

    for i = 1 to n do

    Z [i] = i; choose random index 1  j  i;


    swap Z [i] and Z [j ]
    endfor.

    8. Line segments. Consider a set L of n pairwise


    disjoint line segments in the plane. The distance
    of a point x 2 R2 from ab 2 L is de ned as the
    minimumEuclidean distance from any point on ab:
    kx abk = minfkx yk j y 2 abg:
    The Voronoi region of ab is then the set of points
    x for which ab is no further than any other line
    segment in L.
    (i) Prove that the Voronoi region of every line
    segment in L is connected.
    (ii) Show that the edges of the Voronoi regions
    are pieces of lines and parabolas.
    (iii) Prove that that the number of Voronoi edges
    is at most some constant times n.

    4. Gabriel graph. Let S be a nite set in the plane.


    Let a; b 2 S and consider the smallest circle Cab
    that passes through a and b. The edge ab belongs
    to the Gabriel graph G of S if Cab is empty and a; b
    are the only two points of S that lie on the circle.
    (i) Show that ab 2 G i ab belongs to the Delaunay triangulation and the opposite angles in
    the one or two triangles that share ab are less
    than 2 .
    (ii) Show that ab 2 G i ab crosses the dual
    Voronoi edge Va \ Vb .
    5. Maximum sorted angle vector. Let K be a
    triangulation of a nite set in the plane. Let t
    be the number of triangles and consider the sorted

    16

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy