A paradigm for robust geometric algorithms
From MaRDI portal
Publication:1185288
DOI10.1007/BF01758769zbMath0743.68130OpenAlexW2047710636MaRDI QIDQ1185288
Peter J. Kahn, John E. Hopcrofts
Publication date: 28 June 1992
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01758769
Related Items
Embedding stacked polytopes on a polynomial-size grid, Planar and Toroidal Morphs Made Easier, Robust gift wrapping for the three-dimensional convex hull, Planar and toroidal morphs made easier, Three-dimensional unstructured mesh generation. III: Volume meshes, Tutte's barycenter method applied to isotopies, Small grid embeddings of 3-polytopes, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, A duality transform for constructing small grid embeddings of 3d polytopes, Rigidity and the Alexandrov-Fenchel inequality, A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING, Advances in the theory and practice of graph drawing, Liftings and stresses for planar periodic frameworks
Cites Work
