Optimal Convex Partitions of Point Sets with Few Inner Points Andreas Spillner∗ Abstract We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set - Dynamic convex hull - Document - PDFSEARCH.IO

First Page	Meta Content
	Optimal Convex Partitions of Point Sets with Few Inner Points Andreas Spillner∗ Abstract We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set Add to Reading List Document Date: 2005-07-31 13:55:54 Open Document File Size: 115,01 KB Share Result on Facebook Country Germany / Sweden / / / Facility University Jena / Institute of Computer Science / Lund University / University of Toronto / / IndustryTerm fixed-parameter algorithm / fixed-parameter algorithms / heuristic triangulation algorithm / polynomial time constant-factor approximation algorithms / / Organization University of Toronto / Lund University / Institute of Computer Science / / Position salesman / Traveling Salesman / / Technology fixed-parameter algorithms / fixed-parameter algorithm / polynomial time constant-factor approximation algorithms / heuristic triangulation algorithm / time algorithm / / SocialTag Mathematical optimization Computational geometry Dynamic programming Equations Systems engineering Algorithm Travelling salesman problem Convex hull Kirkpatrick–Seidel algorithm Operations research

Optimal Convex Partitions of Point Sets with Few Inner Points Andreas Spillner∗ Abstract We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a setAdd to Reading List