Small grid embeddings of 3-polytopes (Q629826): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotic Expression for the Number of Solutions of a General Class of Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictly convex drawings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex drawings of 3-connected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Spanning Trees a Planar Graph Can Have / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straightening polygonal arcs and convexifying polygonal cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete one-forms on meshes and applications to 3D mesh parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A paradigm for robust geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the matrix-tree theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Nested Dissection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative Steinitz' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding 3-polytopes on a small grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization spaces of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization spaces of 4-polytopes are universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and uniqueness of packings with specified combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing 3-Polytopes with Good Vertex Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Representations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix theory. Basic results and techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2900727 / rank
 
Normal rank

Revision as of 20:14, 3 July 2024

scientific article
Language Label Description Also known as
English
Small grid embeddings of 3-polytopes
scientific article

    Statements

    Small grid embeddings of 3-polytopes (English)
    0 references
    0 references
    0 references
    0 references
    10 March 2011
    0 references
    3-polytopes
    0 references
    grid embeddings
    0 references
    Steinitz' theorem
    0 references
    equilibrium stresses
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references