𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for minimum length partitions of polygons

✍ Scribed by Andrzej Lingas; Christos Levcopoulos; Jörg Sack

Publisher
Springer Netherlands
Year
1987
Tongue
English
Weight
378 KB
Volume
27
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum K-partitioning of rectilinear po
Minimum K-partitioning of rectilinear polygons
✍ Oliver Gunther 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 941 KB

A minimum k-partition decomposes a rectilinear polygon with n vertices into a minimum number of disjoint rectilinear components with no more than k vertices each (k < n). First, we derive a new lower bound for the number of components in a kpartition. Then we present algorithms to compute minimum k-

Algorithms for the minimum partitioning
Algorithms for the minimum partitioning problems in graphs
✍ Hiroshi Nagamochi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen

A linear-time near-optimum-length triang
A linear-time near-optimum-length triangulation algorithm for convex polygons
✍ Vitit Kantabutra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 400 KB

This paper shows how to compute a short triangulation for a convex polygon in O(n) time, where n is the number of sides of the input polygon. The resulting triangulation is guaranteed to be of a total length that is only a constant factor of the shortest possible.