The following pages link to Transforming triangulations (Q2557708):
Displaying 45 items.
- Spectral properties of unimodular lattice triangulations (Q300599) (← links)
- A three-dimensional parametric mesher with surface boundary-layer capability (Q349159) (← links)
- The edge rotation graph (Q367068) (← links)
- A spectral characterization of the Delaunay triangulation (Q631026) (← links)
- Flips in edge-labelled pseudo-triangulations (Q680154) (← links)
- A Lyapunov function for Glauber dynamics on lattice triangulations (Q682807) (← links)
- On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a prescribed set of vertices (Q687115) (← links)
- All triangulations are reachable via sequences of edge-flips: an elementary proof (Q735461) (← links)
- Minimal roughness property of the Delaunay triangulation (Q751165) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Flips in planar graphs (Q950400) (← links)
- Planar tree transformation: results and counterexample (Q975528) (← links)
- Geometric graphs which are 1-skeletons of unstacked triangulated polygons (Q998427) (← links)
- Geometric coloring theory (Q1239165) (← links)
- Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations (Q1315246) (← links)
- Transforming triangulations in polygonal domains (Q1315799) (← links)
- Refinement operators for triangle meshes (Q1605288) (← links)
- High-order adaptive arbitrary-Lagrangian-Eulerian (ALE) simulations of solidification (Q1649770) (← links)
- Geometric quadrangulations of a polygon (Q1792062) (← links)
- Data-dependent triangulations for scattered data interpolation and finite element approximation (Q1802648) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- A distributed algorithm to maintain a proximity communication network among mobile agents using the Delaunay triangulation (Q2034245) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Connectivity of triangulation flip graphs in the plane (Q2105329) (← links)
- Minimum number of partial triangulations (Q2107503) (← links)
- Robust optimization of attenuation bands of three-dimensional periodic frame structures (Q2115425) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Local properties of the random Delaunay triangulation model and topological models of 2D gravity (Q2327719) (← links)
- Flip distance to some plane configurations (Q2331207) (← links)
- Random lattice triangulations: structure and algorithms (Q2346085) (← links)
- On planar path transformation (Q2379998) (← links)
- Tensor valuations on lattice polytopes (Q2404631) (← links)
- Computing the flip distance between triangulations (Q2408209) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- ON FLIPS IN POLYHEDRAL SURFACES (Q3021956) (← links)
- A Voronoi-based ALE solver for the calculation of incompressible flow on deforming unstructured meshes (Q3083403) (← links)
- Unimodular lattice triangulations as small-world and scale-free random graphs (Q3387629) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
- (Q5111282) (← links)
- Flip Distance to some Plane Configurations. (Q5116475) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Flip paths between lattice triangulations (Q6090067) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
