Transforming triangulations
From MaRDI portal
Publication:2557708
DOI10.1016/0012-365X(72)90093-3zbMath0253.05116OpenAlexW2912041544MaRDI QIDQ2557708
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(72)90093-3
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (49)
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas ⋮ Spectral properties of unimodular lattice triangulations ⋮ Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas ⋮ On planar path transformation ⋮ High-order adaptive arbitrary-Lagrangian-Eulerian (ALE) simulations of solidification ⋮ A three-dimensional parametric mesher with surface boundary-layer capability ⋮ The edge rotation graph ⋮ Tensor valuations on lattice polytopes ⋮ Computing the flip distance between triangulations ⋮ A proof of the orbit conjecture for flipping edge-labelled triangulations ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Flip distance between triangulations of a simple polygon is NP-complete ⋮ Flip paths between lattice triangulations ⋮ Flipping plane spanning paths ⋮ On the longest flip sequence to untangle segments in the plane ⋮ Complexity results on untangling red-blue matchings ⋮ Compatible spanning trees in simple drawings of \(K_n\) ⋮ A spectral characterization of the Delaunay triangulation ⋮ Flip distance between two triangulations of a point set is NP-complete ⋮ Flip distance between triangulations of a planar point set is APX-hard ⋮ Flips in planar graphs ⋮ Flips in edge-labelled pseudo-triangulations ⋮ A Lyapunov function for Glauber dynamics on lattice triangulations ⋮ On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a prescribed set of vertices ⋮ ON FLIPS IN POLYHEDRAL SURFACES ⋮ Planar tree transformation: results and counterexample ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Geometric coloring theory ⋮ A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation ⋮ Geometric quadrangulations of a polygon ⋮ Geometric graphs which are 1-skeletons of unstacked triangulated polygons ⋮ All triangulations are reachable via sequences of edge-flips: an elementary proof ⋮ Unnamed Item ⋮ Data-dependent triangulations for scattered data interpolation and finite element approximation ⋮ A Voronoi-based ALE solver for the calculation of incompressible flow on deforming unstructured meshes ⋮ An improved FPT algorithm for the flip distance problem ⋮ Minimal roughness property of the Delaunay triangulation ⋮ Unimodular lattice triangulations as small-world and scale-free random graphs ⋮ Local properties of the random Delaunay triangulation model and topological models of 2D gravity ⋮ Flip distance to some plane configurations ⋮ Flip Distance to some Plane Configurations. ⋮ On local transformation of polygons with visibility properties. ⋮ Random lattice triangulations: structure and algorithms ⋮ Connectivity of triangulation flip graphs in the plane ⋮ Minimum number of partial triangulations ⋮ Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations ⋮ Transforming triangulations in polygonal domains ⋮ Refinement operators for triangle meshes ⋮ Robust optimization of attenuation bands of three-dimensional periodic frame structures
Cites Work
This page was built for publication: Transforming triangulations
