Small Grid Embeddings of 3-Polytopes
- 30 September 2010
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 45 (1) , 65-87
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Convex Drawings of 3-Connected Plane GraphsAlgorithmica, 2007
- Discrete one-forms on meshes and applications to 3D mesh parameterizationComputer Aided Geometric Design, 2006
- Blowing Up Polygonal LinkagesDiscrete & Computational Geometry, 2003
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision treesComputational Geometry, 1997
- Realization spaces of 4-polytopes are universalBulletin of the American Mathematical Society, 1995
- On the maximal number of edges of convex digital polygons included into an m × m-gridJournal of Combinatorial Theory, Series A, 1995
- A paradigm for robust geometric algorithmsAlgorithmica, 1992
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- A generalization of the matrix-tree theoremMathematische Zeitschrift, 1982
- An asymptotic expression for the number of solutions of a general class of Diophantine equationsTransactions of the American Mathematical Society, 1961