# Author: Scott Wehrwein
# Date: 5/7/25
# L12 Other Practice Problems - triangulating polygons

import turtle

def distance(p1, p2):
    """ Return the distance between 2D points p1 and p2. 
    Precondition: p1 and p2 are 2-tuples containing the
    x and y coordinates of the two points. """


def best_divider(p1, p2, p3, p4):
    """ Return the closest pair of opposite points on the quadrilateral formed by p1,
    p2, p3, and p4. Precondition: p1-p4 are 2-tuples of numbers specifying a
    quadrilateral in counter-clockwise order. """  
    

def draw_triangulation(t, p1, p2, p3, p4):
    """ Draw the triangulated quadrilateral defined by vertices p1, p2, p3, p4 using
    the turtle t. The triangulation connects the closer pair of opposing points.
    Precondition: t is a turtle; p1-p4 are 2-tuples of numbers specifying a
    quadrilateral in counter-clockwise order."""
    

if __name__ == "__main__":
    q = turtle.Turtle()
    p1 = (10, 10)
    p2 = (200, 50)
    p3 = (240, 120)
    p4 = (100, 100)
#     draw_quad(q, p1, p2, p3, p4)
#     draw_triangulation(q, p1, p2, p3, p4) 
