A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
The vast majority of the published skew estimation methods for scanned document images are for textual documents. These methods are based on the principle that the skew angles can...
Digital watermarking is a technique for embedding information into data, such as images, 3D models, or audio files, such that some properties (i. e., security, imperceptibility, ...
Henry Sonnet, Tobias Isenberg, Jana Dittmann, Thom...
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander...