### Table 1.7: The time complexity of some fundamental graph drawing problems: planar graphs and digraphs.

1997

Cited by 14

### TABLE 44.3.2 The time complexity of some fundamental graph drawing problems: planar graphs and digraphs.

### Table 2. Mean selection times (ms) Selection Method

2004

"... In PAGE 5: ... We also found no significant effect due to the snap or border assistive forces. Table2 shows the mean selection times for the menu types and selection methods. These results show the pie menu to be 25% faster than the next best method, the straight linear menu.... ..."

Cited by 3

### Table 2 Summary of previous area/aspect ratio results for planar straight-line grid drawings Class Drawing type Area Aspect ratio(s) Source

2001

### Table 3: Experiments with a simple planar graph 4 Drawing a Simple Planar Graph The graph used in the following experiments is an extension of the graph presented by Nishizeki and Chiba21 as an example of planar graph that haven apos;t convex drawing. So, the algorithm presented in21 can apos;t draw it.

"... In PAGE 7: ... Next, we summarize the experiments we did for illustrating the robustness of the proposed approach. The experiments, functions involved and coe cients are in Table3 , and the GA parameters are in Table 4. Unif corresponds to the uniform crossover originally proposed by Syswerda.... ..."

### Table 1 shows the number of vertices, halfedges, and faces of the six planar maps that comprise the CGM of our squashed dioctagonal pyramid. The number of faces of each planar map include the unbounded face. Table 2 shows the number of features in the primal and dual representations of a small subset of our polytopes col- lection. The number of planar features is the total number of features of the six planar maps.

2006

"... In PAGE 10: ...Constructing the CGM of a model given in the Indexed face set representation is done indirectly. Planar map V HE F 0, (x = 1) 12 32 6 1, (y = 1) 36 104 18 2, (z = 1) 12 32 6 3, (x = 1) 12 32 6 4, (y = 1) 21 72 17 5, (z = 1) 12 32 6 Total 105 304 59 Table1 : The number of features of the six planar maps of the CGM of the dioc- tagonal pyramid object. First, the Cgal Polyhedron 3 data structure that rep- resents the model is constructed [23].... ..."

Cited by 11

### Table 3: Statistics of the renderings with planar brushing.

1997

"... In PAGE 3: ... Since we have already shown the effects of reducing the skin resolution in Figure 3, we do not display the full resolution rendering here. However, the processing time of us- ing full resolution skin data are included in Table3 for comparison purposes. The results show that all renderings depicted in Figure 4, Skin Resolution Brush Resolution Brush Size Time(s) Figure... ..."

Cited by 5

### Table 1 Area-requirements for planar grid tree drawings. not vertices of G. ? is an orthogonal drawing (see Fig. 1.c) if each edge is a chain of alternating horizontal and vertical segments. A grid drawing is such that the vertices and bends along the edges have integer coordinates. Planar drawings, where edges do not intersect, are especially important because they improve the readability of the drawing, and, in the context of VLSI layouts, they simplify the design process [2, 19, 28]. An upward drawing of a directed graph is such that every edge is a curve monotonically nondecreasing in the vertical direction (when traversed along the direction of the edge).

1996

Cited by 12

### Table2. Basic drawing behaviors Conventional

"... In PAGE 4: ... 3.2 [Step2: Investigation of the basic drawing behavior] From the video, we investigated basic drawing behaviors with the drawing software and the conventional tool ( Table2 ). From this, six kinds of category were extracted: tool/color selection, drawing object, tool movement, body movement, face expression, and others.... ..."

### Table 5.1: Comparisons of drawing and recognized face components with incorrect recognition.

2004