May 29, 2013 · Abstract:In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed such a ...

In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed such a drawing in the grid [1 ...

Abstract. In 1926, Jarník introduced the problem of drawing a convex $n$-gon with vertices having integer coordinates. He constructed such a drawing in the ...

We consider the analogous problem for drawing the double circle, and prove that it can be done within the same grid size. Moreover, we give an O(n)-time ...

The smallest enclosing circle is a well-known problem. In this paper, we propose modifications to speed-up the existing Weltzl's algorithm. We perform the ...

We study how to draw a 2n-point double circle with integer points using the smallest size N . We present Drawing the double circle on a grid of minimum size ...

We consider a similar construction for the double circle of 2n points and prove that it can be embedded in a grid of the same asymptotic size. Moreover, we give ...

A convex n-gon with vertices on a “small” integer grid [0, c.n3/2]2, where c > 0 is a constant, is constructed and it is proved that this grid size is ...

We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n-2-Δ) × (n-2-Δ). The parameter Δ ≥ 0 depends on ...

Bibliographic details on Drawing the double circle on a grid of minimum size.