Personal tools

Steiner Reducing Sets of Minimum Weight Triangulations

— filed under:

Cynthia Traub, Southern Illinois University Edwardville

  • Topology Seminar
When Fri, May 03, 2013
from 11:00 AM to 11:50 AM
Where Ritter Hall 316
Add event to calendar vCal
The problem of finding the minimum weight triangulation of a planar point set is a classic problem in computational geometry.  No known algorithm exists which can find this type of triangulation ``quickly" for any finite input set of points in the plane, and this problem was shown to be NP-hard by Mulzer and Rote in 2006.  The addition of points to an input set can have surprising effects on minimum triangulation weight.  We prove that interesting topology arises in this setting.  This topology is due in part to the k-ellipse, a generalized ellipse with k distinct foci.  We will also explore how these curves arise as part of the level-zero set of an interesting family of polynomials


« March 2018 »
Upcoming Events
Math/CS Club
Wed, Mar 21, 2018
100 prisoners Bryan Clair, SLU
Fri, Mar 23, 2018
Introduction to Cluster Algebras Kyungyong Lee, University of Nebraska, Lincoln
Wed, Apr 18, 2018
Quantitative Topology? by Shmuel Weinberger, U Chicago
Annual Awards Ceremony
Fri, Apr 27, 2018
The 2018 Math & Statistics Department Award Ceremony Featuring Sarah Greenwald, Appalachian State University
Previous events…
Upcoming events…