Personal tools
 

Steiner Reducing Sets of Minimum Weight Triangulations

— filed under:

Cynthia Traub, Southern Illinois University Edwardville

What
  • Topology Seminar
When Fri, May 03, 2013
from 11:00 AM to 11:50 AM
Where Ritter Hall 316
Add event to calendar vCal
iCal
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

 

« November 2017 »
November
SuMoTuWeThFrSa
1234
567891011
12131415161718
19202122232425
2627282930