We explore an instance of the question of partitioning a polygon into pieces, each of which is as “circular” as possible, in the sense of having an aspect ratio close to
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...
In this paper, we examine non-stretchable 2D polygonal cloth, and place bounds on the number of fingers needed to immobilize it. For any non-stretchable cloth polygon, it is alwa...
The clear and meaningful visualization of relations between software entities is an invaluable tool for the comprehension, evaluation, and reengineering of the structure of existi...