Global Information Lookup Global Information

Convex drawing information


Convex and strictly convex grid drawings of the same graph

In graph drawing, a convex drawing of a planar graph is a drawing that represents the vertices of the graph as points in the Euclidean plane and the edges as straight line segments, in such a way that all of the faces of the drawing (including the outer face) have a convex boundary. The boundary of a face may pass straight through one of the vertices of the graph without turning; a strictly convex drawing asks in addition that the face boundary turns at each vertex. That is, in a strictly convex drawing, each vertex of the graph is also a vertex of each convex polygon describing the shape of each incident face.

Every polyhedral graph has a strictly convex drawing,[1] for instance obtained as the Schlegel diagram of a convex polyhedron representing the graph. For these graphs, a convex (but not necessarily strictly convex) drawing can be found within a grid whose length on each side is linear in the number of vertices of the graph, in linear time.[2][3] However, strictly convex drawings may require larger grids; for instance, for any polyhedron such as a pyramid in which one face has a linear number of vertices, a strictly convex drawing of its graph requires a grid of cubic area.[4] A linear-time algorithm can find strictly convex drawings of polyhedral graphs in a grid whose length on each side is quadratic.[5]

Convex but not strictly convex drawing of the complete bipartite graph

Other graphs that are not polyhedral can also have convex drawings, or strictly convex drawings. Some graphs, such as the complete bipartite graph , have convex drawings but not strictly convex drawings. A combinatorial characterization for the graphs with convex drawings is known,[6] and they can be recognized in linear time,[7] but the grid dimensions needed for their drawings and an efficient algorithm for constructing small convex grid drawings of these graphs are not known in all cases.[8]

Convex drawings should be distinguished from convex embeddings, in which each vertex is required to lie within the convex hull of its neighboring vertices. Convex embeddings can exist in dimensions other than two, do not require their graph to be planar, and even for planar embeddings of planar graphs do not necessarily force the outer face to be convex.[9]

  1. ^ Cite error: The named reference tutte was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference kant was invoked but never defined (see the help page).
  3. ^ Cite error: The named reference bfm was invoked but never defined (see the help page).
  4. ^ Cite error: The named reference andrews was invoked but never defined (see the help page).
  5. ^ Cite error: The named reference br was invoked but never defined (see the help page).
  6. ^ Cite error: The named reference thomassen was invoked but never defined (see the help page).
  7. ^ Cite error: The named reference cyn was invoked but never defined (see the help page).
  8. ^ Cite error: The named reference zn was invoked but never defined (see the help page).
  9. ^ Cite error: The named reference llw was invoked but never defined (see the help page).

and 25 Related for: Convex drawing information

Request time (Page generated in 0.8545 seconds.)

Convex drawing

Last Update:

In graph drawing, a convex drawing of a planar graph is a drawing that represents the vertices of the graph as points in the Euclidean plane and the edges...

Word Count : 654

Convex function

Last Update:

In mathematics, a real-valued function is called convex if the line segment between any two distinct points on the graph of the function lies above the...

Word Count : 5850

Convex embedding

Last Update:

this way will be a convex polygon, resulting in a convex drawing of the graph. Beyond planarity, convex embeddings gained interest from a 1988 result of...

Word Count : 410

Polyhedral graph

Last Update:

forming a subdivision of an outer convex polygon into smaller convex polygons (a convex drawing of the graph of the polyhedron). It has no crossings, so every...

Word Count : 812

Polyhedron

Last Update:

corners or vertices. A convex polyhedron is a polyhedron that bounds a convex set. Every convex polyhedron can be constructed as the convex hull of its vertices...

Word Count : 9850

Convex and Concave

Last Update:

Convex and Concave is a lithograph print by the Dutch artist M. C. Escher, first printed in March 1955. It depicts an ornate architectural structure with...

Word Count : 181

Diameter

Last Update:

{\displaystyle d=2r\qquad {\text{or equivalently}}\qquad r={\frac {d}{2}}.} For a convex shape in the plane, the diameter is defined to be the largest distance that...

Word Count : 1003

Planar graph

Last Update:

graph is said to be convex if all of its faces (including the outer face) are convex polygons. Not all planar graphs have a convex embedding (e.g. the...

Word Count : 4471

Science and inventions of Leonardo da Vinci

Last Update:

engineering, optics, and the study of water (hydrodynamics). One of Leonardo's drawings, the Vitruvian Man, is a study of the proportions of the human body, linking...

Word Count : 7999

Telescopic sight

Last Update:

case could first give me by its perfect apparition, when I was with two convexes trying experiments about the sun, the unexpected knowledge...if I .......

Word Count : 10864

Oval

Last Update:

they are differentiable (smooth-looking), simple (not self-intersecting), convex, closed, plane curves; their shape does not depart much from that of an...

Word Count : 864

Drawknife

Last Update:

rapid result. The thin blade lends itself to create complex concave or convex curves. Unlike a spokeshave, it does not have a closed mouth to control...

Word Count : 902

Happy ending problem

Last Update:

points minimizing the number of convex quadrilaterals is equivalent to minimizing the crossing number in a straight-line drawing of a complete graph. The number...

Word Count : 1861

Schroeder stairs

Last Update:

inspiration for Escher's Convex and Concave. This illusion is also seen in another Escher's work, Relativity. This drawing may be variously described...

Word Count : 330

Perimeter

Last Update:

piece from a figure, its area decreases but its perimeter may not. The convex hull of a figure may be visualized as the shape formed by a rubber band...

Word Count : 1302

Camera obscura

Last Update:

Magia Naturalis. He suggested to use a convex lens to project the image onto paper and to use this as a drawing aid. Della Porta compared the human eye...

Word Count : 8484

Fan triangulation

Last Update:

only used for convex polygons. Aside from the properties of all triangulations, fan triangulations have the following properties: All convex polygons, but...

Word Count : 303

David Eppstein

Last Update:

shortest paths, dynamic graph data structures, graph coloring, graph drawing and geometric optimization. He has published also in application areas...

Word Count : 798

Euclidean plane

Last Update:

vertex arrangements of the convex regular polygons. In general, for any natural number n, there are n-pointed non-convex regular polygonal stars with...

Word Count : 1963

Geometry

Last Update:

Gromov-hyperbolic groups, and right angled Artin groups. Convex geometry investigates convex shapes in the Euclidean space and its more abstract analogues...

Word Count : 9874

Pentagram

Last Update:

formed from the diagonal line segments of a convex (or simple, or non-self-intersecting) regular pentagon. Drawing a circle around the five points creates...

Word Count : 4063

Central angle

Last Update:

defining or drawing a central angle, in addition to specifying the points A and B, one must specify whether the angle being defined is the convex angle (<180°)...

Word Count : 582

Tessellation

Last Update:

shape is allowed. Polyominoes are examples of tiles that are either convex of non-convex, for which various combinations, rotations, and reflections can be...

Word Count : 6042

Modular weapon system

Last Update:

Drawing of Stoner 63 modular weapon system...

Word Count : 280

Doom engine

Last Update:

"segs". At the leaves of the tree are convex polygons, where further division of the level is not needed. These convex polygons are referred to as subsectors...

Word Count : 2200

PDF Search Engine © AllGlobal.net