How to morph tilings injectively

DOI10.1016/S0377-0427(98)00202-7zbMath0946.52010MaRDI QIDQ1300801

Michael S. Floater, Craig Gotsman

Publication date: 8 October 2000

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

convex combinationstriangulationstilingsmorphingpolygons

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) PL-topology (57Q99) General convexity (52A99)

Related Items

Planar and Toroidal Morphs Made Easier, One-to-one piecewise linear mappings over triangulations, On Compatible Matchings, Subdividing barycentric coordinates, From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs, Planar and toroidal morphs made easier, Mean value coordinates, INTRINSIC MORPHING OF COMPATIBLE TRIANGULATIONS, Spaces of geodesic triangulations of surfaces, Multiresolution morphing for planar curves, On morphing 1-planar drawings, Morphing triangle contact representations of triangulations, Tutte's barycenter method applied to isotopies, The deformation space of geodesic triangulations and generalized Tutte's embedding theorem, Towards compatible triangulations., Pole dancing: 3D morphs for tree drawings, The weighted barycenter drawing recognition problem, On compatible matchings, Morphing Schnyder drawings of planar triangulations, How to Morph Planar Graph Drawings, Convexity-increasing morphs of planar graphs, Convex combination maps over triangulations, tilings, and tetrahedral meshes, Topological Morphing of Planar Graphs, How to morph a tree on a small grid, Morphing Contact Representations of Graphs, Morphing polyhedra with parallel faces: Counterexamples, Pole Dancing: 3D Morphs for Tree Drawings, Morphing Planar Graph Drawings with Bent Edges, Discrete one-forms on meshes and applications to 3D mesh parameterization, An almost optimal bound on the number of intersections of two simple polygons

Cites Work

• Unnamed Item
• Parametrization and smooth approximation of surface triangulations
• On compatible triangulations of simple polygons
• Convex Representations of Graphs
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• How to Draw a Graph