The partition of a problem into smaller sub-problems satisfying certain properties is often a
key ingredient in the design of divide-and-conquer algorithms. For questions related to …

Graph augmentation problems are motivated by network design and have been studied
extensively in optimization. We consider augmentation problems over plane geometric …

We introduce a notion of k-convexity and explore polygons in the plane that have this
property. Polygons which are k-convex can be triangulated with fast yet simple algorithms …

We present two algorithms that compute constant factor approximations of a minimum
convex partition of a set P of n points in the plane. The first algorithm is very simple and …

Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020 Page 1
Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020 Erik D …

This thesis deals with graphs having geometric representations. On one hand we consider
graphs whose vertices can be mapped to geometric objets in an Euclidean space (for …

Given a finite set S of points in the plane, a convex partition of S is a subdivision of the
convex hull of S into nonoverlapping empty convex polygons with vertices in S. Let G (S) be …

A convex partition of a point set P in the plane is a planar subdivision of the convex hull of P
whose edges are segments with both endpoints in P and such that all internal faces are …

On convex decompositions of a planar point set - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Help Search My account Sign in View PDF …

We propose a novel subdivision of the plane that consists of both convex polygons and
pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either …