Patrizio Angelini
email: angelini@dia.uniroma3.it

David Eppstein
email: eppstein@ics.uci.edu

Fabrizio Frati
email: fabrizio.frati@sydney.edu.au

Michael Kaufmann

Sylvain Lazard
email: sylvain.lazard@inria.fr

Tamara Mchedlidze

Monique Teillaud
email: monique.teillaud@inria.fr

Alexander Wolff

Universal Point Sets for Planar Graph Drawing with Circular Arcs

des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Introduction

It is a classic result of graph theory that every planar graph has a planar straight-line drawing, that is, a drawing where vertices are mapped to points in the plane and edges to straight-line segments connecting the corresponding points (achieved independently by Wagner, Fáry, and Stein). Tutte [START_REF] Tutte | How to draw a graph[END_REF] presented the first algorithm, the barycentric method, that produces such drawings. Unfortunately, the barycentric method can produce edges whose lengths are exponentially far from each other. Therefore, Rosenstiehl and Tarjan [START_REF] Rosenstiehl | Rectilinear planar layouts and bipolar orientations of planar graphs[END_REF] asked whether every planar graph has a planar straight-line drawing where vertices lie on an integer grid of polynomial size. De Fraysseix, Pach, and Pollack [START_REF] De Fraysseix | How to draw a planar graph on a grid[END_REF] and, independently, Schnyder [START_REF] Schnyder | Embedding planar graphs on the grid[END_REF] answered this question in the affirmative. Their (very different) methods yield drawings of n-vertex planar graphs on a grid of size Θ(n) × Θ(n), and there are graphs (the so-called "nested triangle graphs") that require this grid size [START_REF] Dolev | Planar embedding of planar graphs[END_REF].

Later, it was apparently Mohar (according to Pach [START_REF] Demaine | The open problems project[END_REF]) who generalized the grid question to the following problem: What is the smallest value f (n) of a universal point set for planar straight-line drawings of n-vertex planar graphs, that is, the smallest size (as a function of n) of a point set S such that every n-vertex planar graph G admits a planar straight-line drawing in which the vertices of G are mapped to points in S? The question is listed as problem #45 in the Open Problems Project [START_REF] Demaine | The open problems project[END_REF]. Despite more than twenty years of research efforts, the best known lower bound for the value of f (n) is linear in n [START_REF] Chrobak | A lower bound on the size of universal sets for planar graphs[END_REF][START_REF] Kurowski | A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs[END_REF], while only an O(n 2 ) upper bound is known, as first established by de Fraysseix et al. [START_REF] De Fraysseix | How to draw a planar graph on a grid[END_REF] and Schnyder [START_REF] Schnyder | Embedding planar graphs on the grid[END_REF]. Very recently, Bannister et al. [START_REF] Bannister | Superpatterns and universal point sets[END_REF] showed a universal point set with n 2 /4 -Θ(n) points for planar straight-line drawings of n-vertex planar graphs. Universal point sets for planar straight-line drawings of planar graphs require more than n points whenever n 15 [START_REF] Cardinal | On universal point sets for planar graphs[END_REF]. Universal point sets with o(n 2 ) points have been proved to exist for planar straight-line drawings of several subclasses of planar graphs, including simply-nested planar graphs [START_REF] Angelini | Small point sets for simply-nested planar graphs[END_REF][START_REF] Bannister | Superpatterns and universal point sets[END_REF], planar 3-trees [START_REF] Fulek | Universal point sets for planar three-trees[END_REF], and graphs of bounded pathwidth [START_REF] Bannister | Superpatterns and universal point sets[END_REF].

Universal point sets have also been studied with respect to different drawing standards. For example, Everett et al. [START_REF] Everett | Universal sets of n points for one-bend drawings of planar graphs with n vertices[END_REF] showed that there exist sets of n points that are universal for planar poly-line drawings with one bend per edge of n-vertex planar graphs. On the other hand, if bends are required to be placed on the point set, universal point sets of size O(n 2 / log n) exist for drawings with one bend per edge, of size O(n log n) for drawings with two bends per edge, and of size O(n) for drawings with three bends per edge [START_REF] Dujmovic | On point-sets that support planar graphs[END_REF].

However, smooth curves may be easier for the eye to follow and more aesthetic than poly-lines. Graph drawing researchers have long observed that polylines may be made smooth by replacing each bend with a smooth curve tangent to the two adjacent line segments [START_REF] Di Battista | Algorithms for drawing graphs: An annotated bibliography[END_REF][START_REF] Gansner | DAG-a program that draws directed graphs[END_REF]. Bekos et al. [START_REF] Bekos | Smooth orthogonal layouts[END_REF] formalized this observation by considering smooth curves made of line segments and circular arcs; they define the curve complexity of such a curve to be the number of segments and arcs it contains. A poly-line drawing with s segments per edge may be transformed into a smooth drawing with curve complexity at most 2s -1, but Bekos et al. [START_REF] Bekos | Smooth orthogonal layouts[END_REF] observed that in many cases the curve complexity can be made smaller than this bound. For instance, replacing poly-lines by curves in the construction of Everett et al. [START_REF] Everett | Universal sets of n points for one-bend drawings of planar graphs with n vertices[END_REF] would give rise to a drawing with curve complexity 3, but in fact every set of n collinear points is universal for smooth piecewise-circular drawings with curve complexity 2, as can be derived from the existence of topological book embeddings of planar graphs [START_REF] Bekos | Smooth orthogonal layouts[END_REF][START_REF] Di Giacomo | Curve-constrained drawings of planar graphs[END_REF][START_REF] Giordano | Computing upward topological book embeddings of upward planar digraphs[END_REF]. A monotone topological book embedding of a graph is a drawing of that graph such that the vertices lie on a horizontal line, called the spine, and the edges are represented by non-crossing curves, monotonically increasing in the direction of the spine. Di Giacomo et al. [START_REF] Di Giacomo | Curve-constrained drawings of planar graphs[END_REF] and, independently, Giordano et al. [START_REF] Giordano | Computing upward topological book embeddings of upward planar digraphs[END_REF] showed that every planar graph has a monotone topological book embedding where each edge crosses the spine exactly once and is represented by the union of two semi-circles that lie below and above the spine (see Figure 2).

The difficulty of constructing a universal point set of linear size for straightline drawings, the aesthetical properties of smooth curves, the recent developments on drawing planar graphs with circular arcs (see, for example, [START_REF] Bekos | Circle-representations of simple 4regular planar graphs[END_REF][START_REF] Eppstein | Planar Lombardi drawings for subcubic graphs[END_REF]), and the existence of universal sets of n points for planar drawings of planar graphs with curve complexity 2 [START_REF] Everett | Universal sets of n points for one-bend drawings of planar graphs with n vertices[END_REF] naturally give rise to the question of whether there exists a universal set of n points for drawings of planar graphs with curve complexity 1, that is, for planar drawings in which every edge is drawn as a single circular arc. In this paper, we answer this question in the affirmative.

We prove the existence of a set S of n points on the parabola P of equation y = -x 2 such that every n-vertex planar graph G can be drawn with the vertices mapped to S and the edges mapped to non-crossing circular arcs. Our proof is constructive and allows us to specify the planar embedding1 of G. We draw G in two steps, in the same spirit as Everett et al. [START_REF] Everett | Universal sets of n points for one-bend drawings of planar graphs with n vertices[END_REF]. In the first step, we construct a monotone topological book embedding of G. In the second step, we map the vertices of G to the points in S in the same order as they appear on the spine of the book embedding.

Circular Arcs Between Points on a Parabola

In this section, we investigate geometric properties of circular-arc drawings whose vertices lie on the parabola P. Let P + be the part of P to the right of the y-axis, that is,

P + = {(x, y) : x 0, y = -x 2 }.
In the following, when we say that a point is to the left of another point, we mean that the x-coordinate of the former is smaller than that of the latter. We say that an arc is to the left of a point q, when the horizontal line through q intersects the arc and all the intersection points are to the left of q. We define similarly to the right, above, and below, and we naturally extend these definitions to non-crossing pairs of arcs. (red) and C 1,2,5 (blue) defined by six points p 0 , . . . , p 5 lying in that order on P + (black). For readability, the figure is not to scale.

We denote by C(p, q, r) the circle through three points p, q, and r. Also, we denote by C p,q,r the circular arc in C(p, q, r) delimited by p and r and containing q; in the sequel, a variant of this notation will also be used: C i,j,k , for three points p i , p j , and p k . For any point p, we denote by x p and y p its x-and y-coordinates.

We start by stating a property of parabolas and circles.

Lemma 1 For every three points p, q, and r on P + with x p < x q < x r , the circle C(p, q, r) intersects the parabola P in p, q, r and in a point of x-coordinate -x px qx r . Furthermore, the circular arc C p,q,r is below P between p and q, and above P between q and r.

Proof: The equation of C(p, q, r) is

x p -x 2 p x 2 p + x 4 p 1 x q -x 2 q x 2 q + x 4 q 1 x r -x 2 r x 2 r + x 4 r 1 x y x 2 + y 2 1 = 0. Substituting y by -x 2 gives (x p -x q ) (x p -x r ) (x q -x r ) (x -x p ) (x -x q ) (x -x r ) (x + x p + x q + x r ) = 0,
which yields the first claim.

Let s denote the point on P with x-coordinate -x px qx r . It is straightforward to see that the arc of C(p, q, r) between s and r and not containing p is below P. The second claim follows.

Consider six points p 0 = (x 0 , y 0 ), . . . , p 5 = (x 5 , y 5 ) on P + , with x 0 x 1 < x 2 < x 3 < x 4 x 5 . Also, consider the following two circular arcs (see Figure 1): C 0,3,4 (red) goes through the ordered points p 0 , p 3 , p 4 and C 1,2,5 (blue) goes through p 1 , p 2 , p 5 .

Arcs C 0,3,4 and C 1,2,5 may not be x-monotone: Consider, for instance, the limit case in which p 0 and p 3 lie at the origin and x 4 > 1. Then the circle C(p 0 , p 3 , p 4 ) supporting C 0,3,4 has its center (0, -r) on the y-axis and radius r > 1. The rightmost point (r, -r) of that circle lies above P (since -r > -r 2 ) and thus on the arc C 0,3,4 by Lemma 1.

Arcs C 0,3,4 and C 1,2,5 are, however, y-monotone, as proved in the following lemma.

Lemma 2 Arcs C 0,3,4 and C 1,2,5 are y-monotone.

Proof: We prove the statement for C 0,3,4 ; the argument for C 1,2,5 is similar. By Lemma 1, p 0 lies on the right half-circle of C(p 0 , p 3 , p 4 ). Further, by assumption, x 0 < x 3 < x 4 . Hence, p 0 , p 3 , and p 4 all lie on the right half-circle of C(p 0 , p 3 , p 4 ) and the statement follows.

We will prove in the following three lemmata that the arcs C 0,3,4 and C 1,2,5 do not intersect each other, except possibly at common endpoints, if x 0 1 and if x i 2x i-1 for i = 3, 4. We consider in these lemmata three cases depending on whether these arcs share one of their endpoints. Refer to Figure 1. Proof: Let q 0,3,4 be the fourth intersection point between C(p 0 , p 3 , p 4 ) and P, and define similarly q 1,2,5 . By Lemma 1, q 0,3,4 and q 1,2,5 have x-coordinates -x 0x 3x 4 and -x 1x 2x 5 , respectively. It follows that q 0,3,4 coincides with or is to the left of q 1,2,5 , because x 3 x 1 + x 2 , x 4 = x 5 , and x 0 0. Furthermore, by Lemma 1, the arc of C(p 0 , p 3 , p 4 ) between q 0,3,4 and p 0 and not containing p 4 is above P, and similarly for the arc of C(p 1 , p 2 , p 5 ) between q 1,2,5 and p 1 and not containing p 5 . These two arcs are above P and their endpoints alternate on P, thus they intersect. It follows that the two circles C(p 0 , p 3 , p 4 ) and C(p 1 , p 2 , p 5 ) intersect in that point and in p 4 = p 5 . Hence, the arcs C 0,3,4 and C 1,2,5 intersect only at p 4 = p 5 . andx 4 x 0 + x 3 , the two circular arcs C 0,3,4 and C 1,2,5 intersect only at p 0 = p 1 .

Lemma 4 If p

0 = p 1 , p 4 = p 5 , x 0 1, x 3 2x 2 ,
Proof: Refer to the middle configuration in Figure 1. We start by stating the following.

Claim 1 C 1,2,5 is to the right of C 0,3,4 in a neighborhood of p 0 .

We first argue that Claim 1 implies Lemma 4. Suppose, for a contradiction, that C 1,2,5 is to the right of C 0,3,4 in a neighborhood of p 0 and that C 0,3,4 and C 1,2,5 intersect in a point q other than p 0 . Since C 1,2,5 is above P in a neighborhood of p 5 , and C 1,2,5 does not intersect P between p 4 and p 5 (by Lemma 1), we have that C 1,2,5 is to the right of p 4 . On the other hand, C 0,3,4 and C 1,2,5 intersect in no point other than q and p 0 . Hence, since C 0,3,4 and C 1,2,5 intersect at q, their horizontal ordering changes in a neighborhood of q and thus C 1,2,5 is to the left of C 0,3,4 in a neighborhood of p 0 , a contradiction.

In order to prove Lemma 4, it remains to prove Claim 1. We can assume without loss of generality that p 5 is at infinity, which means that C 1,2,5 is the straight ray from p 0 = p 1 through p 2 . Indeed, for any point p ′ 5 that lies on P to the right of p 5 , point p ′ 5 lies outside C(p 1 , p 2 , p 5 ), by Lemma 1. Furthermore, since p ′ 5 lies below p 1 and p 2 , the arc through p 1 , p 2 , and p ′ 5 (in that order) lies to the left of C 1,2,5 between p 1 and p 2 . Hence, if the (blue) arc C 1,2,5 is to the left of C 0,3,4 in a neighborhood of p 0 , it remains to the left if p 5 moves to infinity. Now, we prove that the tangents at p 0 = p 1 of C 0,3,4 and C 1,2,5 never coincide. With the above assumption, this is equivalent to showing that the normal to C 0,3,4 at p 0 is never orthogonal to the segment p 1 p 2 . Straightforward computations (though tedious by hand) give that the dot product of that normal and p 1 p 2 is equal to

(x 4 -x 3 ) (x 4 -x 0 ) (x 3 -x 0 ) (x 2 -x 0 )• (x 3 -x 2 ) x 2 4 + (x 3 -x 2 ) (x 0 + x 3 ) x 4 + (x 2 0 -1 -x 3 x 0 -x 2 3 ) x 2 + x 3 0 + x 0 .
The first four factors never vanish. We show that the last factor, seen as a polynomial in x 4 , has no root larger than x 0 + x 3 (it can be shown that this polynomial has a positive root). For that purpose, we make the change of variable x 4 = t + x 0 + x 3 which maps the interval (x 0 + x 3 , +∞) of x 4 to the interval (0, +∞) of t and maps the above degree-2 polynomial in x 4 to

(x 3 -x 2 ) t 2 + 3 (x 3 -x 2 ) (x 0 + x 3 ) t -(1 + x 2 0 + 5x 0 x 3 + 3x 2
3 ) x 2 + x 0 + 4x 0 x 2 3 + x 3 0 + 2x 3 3 + 2x 2 0 x 3 whose first and second coefficients are positive and whose last coefficient is positive for any x 2 ∈ [x 0 , x 3 /2] since it is linear in x 2 and takes value x 3 (3x 0 + 2x 3 ) (x 3 -x 0 ) at x 0 and value 1 2 x 3 (-1+x 2 3 +3x 2 0 +3x 0 x 3 )+x 0 +x 3 0 at x 3 /2, which is positive since x 0 1. Note that the last coefficient is negative when x 2 = x 3 which is why we consider x 2 in the range [x 0 , x 3 /2]. Hence, if x 3 2x 2 , all coefficients of this polynomial are positive, which implies that it has no positive roots. This, in turn, means that the initial degree-2 polynomial in x 4 has no root larger than x 0 + x 3 .

Hence, there is no position of the points p 0 = p 1 , p 2 . . . , p 5 such that x 3 2x 2 , x 4

x 0 + x 3 , and such that the tangent to C 0,3,4 is collinear with p 0 p 2 . Furthermore, at the limit case where p 2 = p 0 , segment p 0 p 2 is tangent to P, and C 0,3,4 is below and to the left of that tangent in a neighborhood of p 0 , by Lemma 1. Thus, C 0,3,4 is to the left of segment p 1 p 2 in a neighborhood of p 0 , and hence to the left of C 1,2,5 in a neighborhood of p 0 . This proves Claim 1 and hence Lemma 4.

We are now ready to prove the following.

JGAA, 18(3) 313-324 (2014) 319

Lemma 5 If p 0 , . . . , p 5 are pairwise disjoint, x 0 1, and x i 2x i-1 for i = 3, 4, the two circular arcs C 0,3,4 and C 1,2,5 do not intersect.

Proof: We refer to the right configuration in Figure 1. Unless specified otherwise, an arc p i p j refers to the arc from p i to p j on the arc C 0,3,4 or C 1,2,5 that supports both p i and p j . We first prove that the arcs p 2 p 5 and p 3 p 4 do not intersect. For any point q on P between p 4 and p 5 , the arc p 3 q on the circular arc through p 0 , p 3 , q lies above the concatenation of the arcs p 3 p 4 of C 0,3,4 and p 4 q of P (since the circular arcs p 3 q and p 3 p 4 lie above P, by Lemma 1, and C(p 0 , p 3 , p 4 ) and C(p 0 , p 3 , q) intersect only at p 0 and p 3 ). It follows that if arc p 3 p 4 intersects arc p 2 p 5 , then arc p 3 q also intersects arc p 2 p 5 for any position of q between p 4 and p 5 on P. This implies that, for the limit case where q = p 5 , arc C 1,2,5 and the circular arc through p 0 , p 3 , and q = p 5 intersect in some point other than q = p 5 , which is not the case by Lemma 3.

We now prove, similarly, that the arcs p 0 p 3 and p 1 p 2 do not intersect. For any point q on P between p 0 and p 1 , the arc qp 2 on the circular arc through q, p 2 , p 5 lies below the concatenation of the arcs qp 1 of P and p 1 p 2 of C 1,2,5 . It follows that if arc p 1 p 2 intersects arc p 0 p 3 , then arc qp 2 also intersects arc p 0 p 3 for any position of q between p 0 and p 1 on P. This implies that, for the limit case where q = p 0 , arc C 0,3,4 and the circular arc through q = p 0 , p 2 , and p 5 intersect in some point other than q = p 0 , which is not the case by Lemma 4.

Finally, arcs p 1 p 2 of C 1,2,5 and p 3 p 4 of C 0,3,4 do not intersect because they lie on different sides of P and similarly for arcs p 0 p 3 of C 0,3,4 and p 2 p 5 of C 1,2,5 . Hence, the two arcs C 0,3,4 or C 1,2,5 do not intersect.

Universal Point Set for Circular Arc Drawings

In this section, we construct a set of n points on P and, by using the lemmata of the previous section, we prove that it is universal for planar circular arc drawings of n-vertex planar graphs.

Consider n2 points 2 q 0 , . . . , q n 2 -1 on the parabolic arc P + such that x 0 1 and x i 2x i-1 for i = 1, . . . , n 2 -1 and consider as a universal point set the n points p i = q ni for i = 0, . . . , n -1. The points that belong to q 0 , . . . , q n 2 -1 but are not in the universal point set are called helper points.

Theorem 1 Every n-vertex planar graph can be drawn with the vertices on p 0 , . . . , p n-1 and with the edges drawn as circular arcs that do not intersect except at common endpoints.

Proof: Let G be a planar graph with n vertices. Construct a monotone topological book embedding Γ of G in which each edge has exactly one spine crossing [START_REF] Di Giacomo | Curve-constrained drawings of planar graphs[END_REF][START_REF] Giordano | Computing upward topological book embeddings of upward planar digraphs[END_REF]. Denote by w 0 , . . . , w n-1 the order of the vertices of G on the spine in Γ. We substitute every spine crossing with a dummy vertex and denote by Γ ′ the resulting embedded graph. The relative position of any two edges in Γ is as depicted in Figure 2 (in which two edges may share their endpoints). For 0 i n -1, we map vertex w i to point p i . Furthermore, for each 0 i n -2, we map the dummy vertices that lie in between w i and w i+1 on the spine in Γ ′ to distinct helper points in between p i and p i+1 , so that the order of the dummy vertices on P is the same as on the spine in Γ ′ . (We postpone the proof that there are enough helper points to map the dummy vertices.) We finally draw every edge (w i , w j ) of G containing a dummy vertex d l as a circular arc that is delimited by p i and p j , and that passes through the helper point onto which vertex d l has been mapped. We prove that the resulting drawing is planar. In the following, we say that the circular-arc drawings of two edges in Γ or Γ ′ do not intersect if they do not intersect except at common endpoints.

By Lemmata 3, 4, and 5, the circular-arc drawings of any two edges whose relative positions in Γ are as depicted in Figure 2(a) do not intersect.

For the pairs of edges whose relative positions in Γ are as depicted in Figures 2(b) and 2(c), it is straightforward to check that their circular-arc drawings do not intersect: any two edges in Γ ′ are either separated by the spine or by a vertical line, hence their circular-arc drawings are either separated by P or by a horizontal line (since by Lemma 2 the circular-arc drawings are y-monotone).

Consider two edges (w i , w l ) and (w j , w k ) whose relative position in Γ is as depicted in Figure 2(d) and consider the corresponding four edges in Γ ′ (the argument for the pairs of edges as in Figure 2(e) is analogous). Denote by d il and d jk the dummy vertices of these edges, and by q il and q jk the helper points on P onto which they are mapped. Edges (d il , w l ) and (w j , d jk ) are separated by the spine in Γ ′ , hence their circular-arc drawings do not intersect since they are separated by P. The same argument holds for edges (w i , d il ) and (d jk , w k ). Further, edges (w i , d il ) and (w j , d jk ) are separated by a vertical line in Γ ′ , hence their circular-arc drawings do not intersect since they are separated by a horizontal line (since by Lemma 2 the circular-arc drawings are y-monotone).

Hence, it suffices to prove that the circular-arc drawings of the edges (d il , w l ) and (d jk , w k ) do not intersect. The circular-arc drawing of (d jk , w k ) is the arc (a) (b) q jk p k on C(p j , q jk , p k ). Roughly speaking, this arc inflates if p j moves left on P, by Lemma 1. More formally, for any point r on P + that is left of p j , the arc q jk p k on C(r, q jk , p k ) lies above the arc q jk p k on C(p j , q jk , p k ). Hence, if the former arc q jk p k does not intersect the circular-arc drawing of (d il , w l ), neither does the latter. By considering r = p i , these arcs do not intersect by Lemma 4 if p k = p l and, if p k = p l , they also do not intersect since their supporting circles are distinct (q il = q jk ) and intersect in the two points r = p i and p k = p l . It remains to show that there are enough helper points to map the dummy vertices. There are n -1 helper points q ni+1 , . . . , q n(i+1)-1 between each pair of points p i = q ni and p i+1 = q n(i+1) . It thus suffices to prove that there are at most n -1 dummy vertices in between v i and v i+1 along the spine in Γ ′ .

u 1 u k v 1 v k u 1 u k v 1 v k
Let (u 1 , v 1 ), . . . , (u k , v k ) be k edges in the book embedding Γ that define consecutive dummy vertices on the spine (possibly u i = u i+1 , for any 1 i k -1; also, possibly v i = v i+1 , for any 1 i k -1; however, u i = u i+1 and v i = v i+1 do not hold simultaneously, for any 1 i k -1). If no vertex w i lies in between these dummy vertices on the spine in Γ, the k edges are such that u 1 , . . . , u k , v 1 , . . . , v k are ordered from left to right on the spine in Γ; see Figure 3(a). Now, consider the graph that consists of these edges plus the edges (u i , u i+1 ), (v i , v i+1 ), for i = 1, . . . , k -1; see Figure 3(b). This graph is outerplanar. It has at most n vertices and, thus, at most n -3 chords. On the other hand, it has exactly k -2 chords: (u 2 , v 2 ), . . . , (u k-1 , v k-1 ). This implies that k -2 n -3. Hence k n -1, which concludes the proof.

In conclusion of this section, we observe that Theorem 1 also holds for a plane graph, that is, a planar graph provided with a planar embedding. In the above proof, we compute a monotone topological book embedding of the given plane graph using an algorithm by Giordano et al. [START_REF] Giordano | Computing upward topological book embeddings of upward planar digraphs[END_REF]. Their algorithm preserves the embedding of the given graph, and so does the rest of our construction.

Conclusion

We proved the existence of a universal point set with n points for planar circular arc drawings of planar graphs. The universal point set we constructed has an area of 2 O(n 2 ) . It would be interesting, also for practical visualization purposes, to construct a universal point set with n points for planar circular arc drawings of planar graphs within polynomial area. In this direction, we remark that (relaxing the requirement that the set has exactly n points) a universal point set with O(n) points and within 2 O(n) area for planar circular arc drawings of planar graphs is Q = {q 0 , . . . , q 4n-7 } (as defined in Section 3). To construct a planar circular-arc drawing of a planar graph G on Q, it suffices to map the n vertices and the up to 3n-6 dummy vertices of a monotone topological book embedding of G to the points of Q in the order they appear in the book embedding. The geometric lemmata of Section 2 ensure that the resulting drawing is planar.

5 Figure 1 :

 51 Figure 1: Three configurations of relative position of the circular arcs C 0,3,4(red) and C 1,2,5 (blue) defined by six points p 0 , . . . , p 5 lying in that order on P + (black). For readability, the figure is not to scale.

Lemma 3

 3 If p 0 = p 1 , p 4 = p 5 , and x 3 x 1 + x 2 , the two circular arcs C 0,3,4 and C 1,2,5 intersect only at p 4 = p 5 .

Figure 2 :

 2 Figure 2: Relative positions of two edges in a monotone topological book embedding.

Figure 3 :

 3 Figure 3: (a) k edges of a monotone topological book embedding that defines k consecutive dummy vertices (spine crossings). (b) Augmented outerplanar graph.

A planar embedding of a planar graph is a representation of the graph in which its vertices are identified to distinct points in the plane and its edges are associated to simple arcs that do not intersect except at common vertices.

We consider n 2 points for simplicity but we do not actually use the last n -1 of them.

Acknowledgments

This research started during Dagstuhl Seminar 13151 "Drawing Graphs and Maps with Curves" in April 2013. The authors wish to thank the organizers and the participants for many useful discussions. We would also like to thank the anonymous referees for their simplification of the proof of Lemma 3.

JGAA, 18(3) 313-324 (2014) 323

David Eppstein was supported in part by the National Science Foundation under grants 0830403 and 1217322, and by the Office of Naval Research under MURI grant N00014-08-1-1015. Patrizio Angelini, Michael Kaufmann, and Alexander Wolff acknowledge support by the ESF EuroGIGA project GraDR (DFG grants Ka 812/16-1 and Wo 758/5-1).