Morphing Graphs on Hyperbolic Surfaces

Yanwen Luo; Yuan Luo

REVIEW 3 major objections 3 minor 31 references

Morphing Graphs on Hyperbolic Surfaces

T0 review · 3 major / 3 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A generalization of Tutte's spring embedding theorem yields the first algorithm to morph graphs on hyperbolic surfaces of genus at least two.

desk verdict First morphing algorithm for hyperbolic surfaces, with real experiments, but Theorem 2.2's existence/uniqueness is asserted, not proved. read the letter →

arxiv 2607.21469 v1 pith:VONCXS2K submitted 2026-07-23 math.GT cs.CG

Yanwen Luo , Yuan Luo This is my paper · ORCID

classification math.GTcs.CG MSC 57K2057M1568U05

keywords graphmorphinghyperbolicsurfacesTutteembeddingbalancedgeodesicmappingsmeanvaluecoordinatescellulardecompositionBolzasurfaceKleinquartic

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes the first algorithm to continuously morph one geodesic graph embedding into another on a closed hyperbolic surface of genus at least two. The strategy is to generalize Tutte's spring embedding theorem to essentially 3-connected cellular decompositions: for any positive directed-edge weights there is a unique balanced geodesic embedding, so the space of embeddings can be parameterized by weights. The algorithm computes hyperbolic mean-value coordinates of two endpoint embeddings, linearly interpolates those weights, and reconstructs the intermediate balanced embeddings by gradient descent in the Poincaré disk. Experiments on genus-2 and genus-3 surfaces show all frames remain embedded and convex. If correct, the result opens the graph morphing problem to all higher-genus hyperbolic surfaces, where no algorithm previously existed.

What carries the argument

The load-bearing object is the balanced geodesic mapping parameterized by positive directed edge weights. Mean-value coordinates compute weights from an embedding; linear interpolation in weight space and then applying the balanced mapping yields the morph. In practice the balanced mapping is found by gradient descent on a local energy whose zero gradient is exactly the balance equation, computed in the Poincaré disk with Möbius side-pairing transformations used to pull gradient contributions from slave copies back to the root vertex.

What would settle it

Pick an essentially 3-connected cellular decomposition with a pentagonal face on a hyperbolic surface, choose positive directed edge weights, and solve the balance equations with two independent numerical solvers; if the presumed unique balanced mapping differs between solvers, or if the computed mapping has a self-intersecting edge or a non-convex face, Theorem 2.2 and the morphing guarantee would be refuted.

Watch

Extended reading notes

Core claim

The paper's central claim is Theorem 2.2: for any positive weight assignment on the directed edges of an essentially 3-connected cellular decomposition of a closed hyperbolic surface, there is a unique balanced geodesic mapping—at every vertex the weighted tangent vectors of incident edges sum to zero—and this mapping is an embedding in which every face is a strictly convex geodesic polygon. This extends an earlier result for triangulations to graphs with quadrilateral, pentagonal, and larger faces. The appendix proves the embedding and convexity part with an angle-structure index argument, and the paper states that the existence and uniqueness part follows by generalizing the triangulation

Load-bearing premise

The proof that a balanced mapping is a convex embedding is complete, but the existence and uniqueness of that mapping for non-triangulated essentially 3-connected cellular decompositions is carried over by assertion from the triangulation case; if that generalization fails, the map from interpolated weights to intermediate embeddings is not defined.

Editorial extensions

If this is right

The algorithm claims to be the first to morph graphs on surfaces of genus at least two, extending previous planar and torus algorithms.
Any pair of convex geodesic embeddings of the same essentially 3-connected cellular decomposition can be connected by a sequence of embeddings, not just by a topological isotopy.
Cellular decompositions with higher-order faces can be morphed without first triangulating, preserving quadrilateral and pentagonal cells.
Every intermediate frame is a balanced geodesic embedding, giving each frame a clean variational characterization.
The method is demonstrated on genus-2 Bolza and genus-3 Klein quartic surfaces with all tested frames embedded and convex.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The same weight-interpolation scheme should also work for flat tori, making the weight-space approach a common framework for all non-positive constant-curvature surfaces; the paper does not make this comparison.
The appendix's index argument may imply more than one morph: it may imply the full space of convex geodesic embeddings of an essentially 3-connected cellular decomposition is contractible, strengthening the theoretical guarantee.
A natural stress test is morphing between embeddings with different cellular decompositions by first refining to a common subdivision; the paper only handles fixed combinatorics.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Here's my take. The claim that this is the first algorithm to morph geodesic graphs on hyperbolic surfaces of genus at least two is likely right; I don't see a prior algorithm in their references. The experiments are real and reproducible: public code, four test cases on the Bolza surface and Klein quartic, N=25 frames, no crossings, all faces convex. That is the most honest part of the paper and it earns credit.

What's actually new mathematically is the appendix: a balanced geodesic mapping for an essentially 3-connected cellular decomposition is an embedding whose cells are strictly convex hyperbolic polygons. The proof uses an index theorem and extends the triangulation version. I read it through; the argument looks plausible and the subdivision step is adapted from Gortler–Gotsman–Thurston. But note the hypothesis: the proof starts with "a balanced geodesic mapping." It does not produce one.

The soft spot is Theorem 2.2. The existence and uniqueness of a balanced mapping for every positive weight on directed edges—and the continuity of that correspondence—is the real foundation of the algorithm. For triangulations it follows from [25]. For cellular decompositions with quadrilateral and pentagonal faces, the paper states "the argument can be directly generalized" and then does not prove it. The appendix does not cover it. So the map Ψ from weight space to embedding space, which the algorithm depends on, is not proven to exist or to be continuous. That is a load-bearing gap, not a cosmetic one.

Is it fatal? Possibly not. The experiments suggest the map is well-behaved in practice, and the missing theorem is likely true—the triangulation techniques may indeed generalize. But a reader who wants to rely on the algorithm needs to see the proof, not an assertion.

I'd send this to referees. The problem is important, the experiments are concrete, and the gap is addressable. But I'd make the authors either provide the full existence/uniqueness proof or restrict the theoretical statement to triangulations and present the cellular cases as experiments. For a reading group, maybe—it's a clean example of a proof gap in a computational geometry paper. I wouldn't cite the theorem as proven in my own work.

Referee Report

3 major / 3 minor

Summary. The manuscript proposes an algorithm for morphing two convex geodesic embeddings of a graph on a closed hyperbolic surface. The method follows the Floater--Gotsman framework: compute hyperbolic mean-value directed edge weights at the two endpoint embeddings, linearly interpolate these weights, and for each interpolated weight produce the unique w-balanced geodesic embedding whose existence is claimed by Theorem 2.2. The theorem is stated for essentially 3-connected cellular decompositions, with the injectivity/convexity half proved in the appendix and the existence/uniqueness half asserted to follow by direct generalization of the authors' earlier triangulation result [25]. Experiments are reported on the genus-2 Bolza surface and the genus-3 Klein quartic for both triangulations and cellular decompositions with quadrilateral and pentagonal faces.

Significance. If the full statement of Theorem 2.2 is correct, the paper delivers the first morphing algorithm for graphs on hyperbolic surfaces of genus at least two and gives a useful extension of Tutte-type embedding theory beyond triangulations. The appendix contributes a nontrivial index-theoretic argument showing that, conditional on existence, a balanced geodesic mapping is an embedding with strictly convex polygonal faces. The implementation is publicly available and the experiments cover nontrivial surfaces and higher-order faces, which is a concrete strength. However, the unproved existence/uniqueness half of Theorem 2.2 is load-bearing for the entire algorithm, and the continuity of the map from weights to embeddings is also asserted without proof.

major comments (3)

[§2.2, Theorem 2.2] The existence and uniqueness of a balanced geodesic mapping for every positive weight on an essentially 3-connected cellular decomposition is the mathematical foundation of the algorithm, but it is not proved in the manuscript. Section 2.2 states that the triangulation result of [25] 'can be directly generalized,' and the appendix (Theorem 6.1) only proves that a balanced geodesic mapping -- assumed to exist -- is an embedding with strictly convex faces. For cellular decompositions with faces of size greater than three, the domain of the map Ψ used in Section 3 is therefore not established. Without existence, the intermediate frames w_t produced by interpolating weights need not correspond to any balanced embedding. This gap must be closed, either by a full proof or by a precise reduction to [25] that handles higher-order faces.
[§3, Methodology] The text says 'Theorem 2.2 defines a continuous map Ψ from the space of positive weights on directed edges to the space of geodesic embeddings,' but Theorem 2.2 as stated does not assert continuity, and no continuity proof is given. Even granting existence and uniqueness pointwise in w, the morph t → Ψ((1−t)w0 + t w1) is continuous only if the balanced embedding varies continuously in the weight. This requires an additional argument, typically via uniqueness plus compactness or an implicit-function theorem. The current manuscript leaves this load-bearing property unstated and unproved.
[§4, Algorithms 2 and 3] The numerical core is a gradient descent with no convergence guarantee. The iteration stops when the maximum vertex displacement is below ε = 1e−8 or when the budget Kmax = 10k is reached, but there is no proof that the limit (or the early-stopped iterate) satisfies the w-balance equation (2.1), nor that it remains an embedding. The experiments show that the procedure works for the reported N=25 frames, which is useful evidence, but without an algorithmic convergence proof the claim of a 'solid mathematical foundation' for the computed intermediate frames goes beyond what is demonstrated. This should be addressed, or the method explicitly presented as a heuristic numerical scheme.

minor comments (3)

[§1, Introduction] The phrase 'Klein quadrics of genus 3' appears to be a typo for 'Klein quartic,' which is the correct term used elsewhere in the paper.
[Appendix, final paragraph] The sentence 'since G is essentially 3-connected, there is digon or monogon' appears to be missing the word 'no' before 'digon or monogon.' As written it contradicts Theorem 6.8, property 2, which forbids faces of size less than 3. This typo should be corrected.
[§2.2, Definition of essential 3-connectivity] The definition via 3-connectivity of the lift to the universal cover is stated compactly. It would help to clarify explicitly that this notion rules out faces of size less than 3 and vertices of degree less than 3, since those properties are used in the appendix proof.

Circularity Check

1 steps flagged · score 4.0 of 10

Theorem 2.2's existence/uniqueness is inherited from a self-cited triangulation theorem by an unproved generalization; the appendix proves only the conditional embedding statement.

self citation load bearing [Section 2.2 (Theorem 2.2), used in Section 3; Appendix Theorem 6.1]
"One restricted version of the above theorem for triangulations has been proved in [25], where the existence and uniqueness of the geodesic mapping was established based on the analysis of one-ring neighborhood of the lift in D. Therefore, the argument can be directly generalized to essentially 3-connected cellular decompositions. In the Appendix, we will prove that balanced geodesic mappings for essentially 3-connected graphs are geodesic embeddings such that every face is embedded as a convex hyperbolic polygon."

The map Ψ from positive weights to geodesic embeddings, which Section 3 uses to define the morphing frames, is well-defined only if Theorem 2.2 supplies existence and uniqueness for every essentially 3-connected cellular decomposition. The paper does not prove those two clauses here: it cites the authors' prior triangulation theorem [25] and asserts that the argument 'can be directly generalized,' while the appendix's Theorem 6.1 is explicitly conditional ('a balanced geodesic mapping ... is an embedding'), presupposing the balanced mapping whose existence is at issue. Thus the domain of Ψ rests on a self-cited prior theorem plus an unproved generalization, not on a derivation contained in this paper. The central morphing prediction is therefore not independently established for faces of s

full rationale

The only documented circularity is the load-bearing self-citation/incomplete proof around Theorem 2.2. The remainder of the pipeline is not circular: the mean-value weight computation, the gradient-descent update, and the experiments do not fit a parameter and then re-predict a closely related quantity, and the appendix does give a genuine (if conditional) proof that balanced geodesic mappings of essentially 3-connected complexes are convex embeddings, using cited lemmas from [25] and [10]. The absence of an existence/uniqueness proof for non-triangulated cellular decompositions is a correctness gap: if Theorem 2.2 fails, Ψ is undefined and the algorithm loses its theoretical guarantee. It is not, however, a case of 'fitted input renamed as prediction,' because no output frame is forced by construction from a fitted parameter. The asserted continuity of Ψ is part of the same unproved generalization and is flagged here rather than counted as a separate circular step. A score of 4 reflects one load-bearing reliance on self-citation with independent algorithmic and experimental content; a higher score would require the derivation itself to reduce to its inputs by construction, which is not the case.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

No new physical or mathematical entities are postulated. The free parameters are numerical solver settings, while the main external dependencies are the authors' prior triangulation theorem and the balancing property of hyperbolic mean value coordinates.

free parameters (2)

gradient descent step size η = not reported
Used in Algorithm 2/3 to update vertices; convergence of the solver and hence the morph depends on it, but the paper does not specify its value or a line-search rule.
stopping tolerance ε and iteration budget Kmax = ε=10^-8, Kmax=10k (N=25 frames)
Chosen for the reported experiments; not fitted to data, but the numerical correctness of the morph depends on reaching a balanced embedding.

assumptions (4)

ad hoc to paper Existence and uniqueness of a balanced geodesic mapping for every positive weight on an essentially 3-connected cellular decomposition (Theorem 2.2)
Stated as Theorem 2.2 in Section 2.2; the appendix proves only injectivity/convexity of an existing balanced map, while existence/uniqueness for non-triangulated cellular decompositions is asserted to follow by direct generalization of [25].
domain assumption Hyperbolic mean value coordinates of the endpoint embedding satisfy the w-balance condition, so Ψ(σ(τ0))=τ0 and Ψ(σ(τ1))=τ1
Section 2.3 lists positivity, partition of unity, smoothness, and isometry invariance, but does not state or prove the balancing/reproduction identity required by the morphing framework in Section 3.
domain assumption The maps Ψ (weights to balanced embedding) and σ (embedding to mean value weights) are continuous, so linear interpolation of weights gives a continuous morph
Used implicitly in Section 3 and Algorithm 3; continuity is plausible from [25] but not established in this paper.
domain assumption Lemmas 3.5 and 3.6 from [25] and the angle-structure/index arguments from [10] carry over to the cellular setting
The appendix reuses these results by citation; if they do not carry over, the proof of Theorem 6.1 breaks.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Morphing Graphs on Hyperbolic Surfaces." pith.science (2026). https://pith.science/paper/VONCXS2K

@misc{pith2026260721469,
  author       = {Pith},
  title        = {Pith review of: Morphing Graphs on Hyperbolic Surfaces},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VONCXS2K}},
  note         = {Machine review of arXiv:2607.21469}
}

read the original abstract

We propose the first algorithm to morph geometric graphs on hyperbolic surfaces. It is based on a generalization of Tutte's spring embedding theorem on essentially 3-vertex-connected graphs. We describe the algorithms in detail and show experiments with triangulations and graphs on a hyperbolic surface of genus two, the Bolza surface, and a hyperbolic surface of genus three, the Klein quartic.

Figures

Figures reproduced from arXiv: 2607.21469 by the authors.

**Figure 1.** The framework in [17] evaluated at the discrete time 0 = t0 < t1 < · · · < tN = 1. map σ from X(S, G, φ) to the space of positive weights on directed edges. We will use both maps to generate a family of geodesic embeddings connecting two given geodesic embeddings. Let τ0 and τ1 be two geodesic embeddings in X(S, G, φ). We find their hyperbolic mean value coordinates through σ, w 0 ij = σ(τ0) and w 1 ij = σ(τ1). Sinc… view at source ↗

**Figure 2.** Genus–2 triangulation morph. It has 190 vertices, 527 edges, and 338 triangular [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗

**Figure 3.** Genus–2 cellular morph. It has 190 vertices, 490 edges, 270 triangles, 25 quadri [PITH_FULL_IMAGE:figures/full_fig_p014_3.png] view at source ↗

Figures from the paper (3 more)

**Figure 4.** Figure 4: Genus–3 triangulation morph on the Klein quartic fundamental domain. It has 250 [PITH_FULL_IMAGE:figures/full_fig_p015_4.png]

**Figure 5.** Figure 5: Genus–3 cellular morph. It has 250 vertices, 557 edges, 208 triangles, 80 quadrilat [PITH_FULL_IMAGE:figures/full_fig_p016_5.png]

**Figure 6.** Figure 6: Left: Polygon with intersections. Right: A face of 2nd type with red edges in [PITH_FULL_IMAGE:figures/full_fig_p020_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 2 linked inside Pith

[25]

The deformation space of geodesic tri- angulations and generalized Tutte’s embedding theorem

Luo, Yanwen, Tianqi Wu, and Xiaoping Zhu. “The deformation space of geodesic tri- angulations and generalized Tutte’s embedding theorem.” Geometry & Topology 27.8 (2023): 3361-3385

2023
[1]

How to morph planar graph drawings

Alamdari, Soroush, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati et al. “How to morph planar graph drawings.” SIAM Journal on Computing 46, no. 2 (2017): 824-852

2017
[2]

Spaces of geodesic triangulations of the sphere

Awartani, Marwan, and David W. Henderson. “Spaces of geodesic triangulations of the sphere.” Transactions of the American Mathematical Society 304, no. 2 (1987): 721-732

1987
[3]

Linear isotopies inE 2

Bing, R. H., and Michael Starbird. “Linear isotopies inE 2.” Transactions of the Amer- ican Mathematical Society 237 (1978): 205-222

1978
[4]

Strictly convex simplexwise linear embeddings of a 2-disk

Bloch, Ethan D. “Strictly convex simplexwise linear embeddings of a 2-disk.” Transac- tions of the American Mathematical Society 288, no. 2 (1985): 723-737

1985
[5]

The space of simplexwise linear homeomorphisms of a convex 2-disk

Bloch, Ethan D., Robert Connelly, and David W. Henderson. “The space of simplexwise linear homeomorphisms of a convex 2-disk.” Topology 23, no. 2 (1984): 161-175

1984
[6]

Deformations of plane rectilinear complexes

Cairns, Steward S. “Deformations of plane rectilinear complexes.” The American Math- ematical Monthly 51, no. 5 (1944): 247-252

1944
[7]

Isotopic deformations of geodesic complexes on the 2-sphere and on the plane

Cairns, Stewart S. “Isotopic deformations of geodesic complexes on the 2-sphere and on the plane.” Annals of Mathematics 45, no. 2 (1944): 207-217

1944

Show all 31 references

[8]

How to morph graphs on the torus

Chambers, Erin Wolf, Jeff Erickson, Patrick Lin, and Salman Parsa. “How to morph graphs on the torus.” In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2759-2778. Society for Industrial and Applied Mathematics, 2021

2021
[9]

Convex drawings of graphs in two and three dimensions (preliminary version)

Chrobak, Marek, Michael T. Goodrich, and Roberto Tamassia. “Convex drawings of graphs in two and three dimensions (preliminary version).” In Proceedings of the twelfth annual symposium on Computational geometry, pp. 319-328. 1996

1996
[10]

Comment rendre g´ eod´ esique une triangulation d’une surface

Colin de Verdiere, Yves. “Comment rendre g´ eod´ esique une triangulation d’une surface.” L’Enseignement Math´ ematique 37 (1991): 201-212

1991
[11]

Henderson, Chung Wu Ho, and Michael Starbird

Connelly, Robert, David W. Henderson, Chung Wu Ho, and Michael Starbird. ”On the problems related to linear homeomorphisms, embeddings, and isotopies.” In Continua, decompositions, manifolds, pp. 229-239. 1983

1983
[12]

Hyperbolic barycentric coordinates and applications

Eddine Bensad, Alaa, and Aziz Ikemakhen. “Hyperbolic barycentric coordinates and applications.” Computer Aided Geometric Design 95 (2022): 102086

2022
[13]

Shelling and Sinking Graphs on the Sphere

Erickson, Jeff, and Christian Howard. “Shelling and Sinking Graphs on the Sphere.” In 41st International Symposium on Computational Geometry (SoCG 2025), pp. 47-1. Schloss Dagstuhl–Leibniz-Zentrum f¨ ur Informatik, 2025

2025
[14]

Planar and toroidal morphs made easier

Erickson, Jeff, and Patrick Lin. “Planar and toroidal morphs made easier.” In Interna- tional Symposium on Graph Drawing and Network Visualization, pp. 123-137. Cham: Springer International Publishing, 2021

2021
[15]

Intersection-free morphing of planar graphs

Erten, Cesim, Stephen G. Kobourov, and Chandan Pitta. “Intersection-free morphing of planar graphs.” In International Symposium on Graph Drawing, pp. 320-331. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003

2003
[16]

Mean value coordinates

Floater, Michael S. “Mean value coordinates.” Computer aided geometric design 20, no. 1 (2003): 19-27. 17

2003
[17]

How to morph tilings injectively

Floater, Michael S., and Craig Gotsman. “How to morph tilings injectively.” Journal of Computational and Applied Mathematics 101, no. 1-2 (1999): 117-129

1999
[18]

Computing discrete equiv- ariant harmonic maps

Gaster, Jonah, Brice Loustau, and L´ eonard Monsaingeon. “Computing discrete equiv- ariant harmonic maps.” arXiv preprint arXiv:1810.11932 (2018)

2018 arXiv
[19]

Discrete one-forms on meshes and applications to 3D mesh parameterization

Gortler, Steven J., Craig Gotsman, and Dylan Thurston. “Discrete one-forms on meshes and applications to 3D mesh parameterization.” Computer Aided Geometric Design 23.2 (2006): 83-112

2006
[20]

Guaranteed intersection-free polygon morph- ing

Gotsman, Craig, and Vitaly Surazhsky. “Guaranteed intersection-free polygon morph- ing.” Computers & Graphics 25, no. 1 (2001): 67-75

2001
[21]

On certain homotopy properties of some spaces of linear and piecewise linear homeomorphisms. I

Ho, Chung Wu. “On certain homotopy properties of some spaces of linear and piecewise linear homeomorphisms. I.” Transactions of the American Mathematical Society 181 (1973): 213-233

1973
[22]

On certain homotopy properties of some spaces of linear and piecewise linear homeomorphisms. II

Ho, Chung Wu. “On certain homotopy properties of some spaces of linear and piecewise linear homeomorphisms. II.” Transactions of the American Mathematical Society 181 (1973): 235-243

1973
[23]

Morphing planar graphs in spherical space

Kobourov, Stephen, and Matthew Landis. “Morphing planar graphs in spherical space.” Journal of Graph Algorithms and Applications 12, no. 1 (2008): 113-127

2008
[24]

Spaces of geodesic triangulations of surfaces

Luo, Yanwen. “Spaces of geodesic triangulations of surfaces.” Discrete & Computational Geometry 68, no. 3 (2022): 709-727

2022
[26]

The deformation space of Delaunay triangulations of the sphere

Luo, Yanwen, Tianqi Wu, and Xiaoping Zhu. “The deformation space of Delaunay triangulations of the sphere.” Pacific Journal of Mathematics 323, no. 1 (2023): 115- 127

2023
[27]

Circle packings of maps in polynomial time

Mohar, Bojan. “Circle packings of maps in polynomial time.” European Journal of Combinatorics 18.7 (1997): 785-805

1997
[28]

Discrete harmonic maps between hyperbolic surfaces

Lam, Wai Yeung. “Discrete harmonic maps between hyperbolic surfaces.” Calculus of Variations and Partial Differential Equations 64, no. 8 (2025): 247

2025
[29]

Deformations of plane graphs

Thomassen, Carsten. “Deformations of plane graphs.” Journal of Combinatorial Theory, Series B 34, no. 3 (1983): 244-257

1983
[30]

How to draw a graph

Tutte, William Thomas. “How to draw a graph.” Proceedings of the London Mathe- matical Society 3, no. 1 (1963): 743-767

1963
[31]

A Structure-Preserving Nu- merical Method for Harmonic Maps Between High-genus Surfaces

Zhu, Zhipeng, Wai Yeung Lam, and Lok Ming Lui. “A Structure-Preserving Nu- merical Method for Harmonic Maps Between High-genus Surfaces.” arXiv preprint arXiv:2509.01256 (2025). 18 6 Appendix: Theorem 2.2 for essentially 3-connected graphs The goal of this appendix is to prove...

2025 arXiv

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.

[1] [25]

The deformation space of geodesic tri- angulations and generalized Tutte’s embedding theorem

Luo, Yanwen, Tianqi Wu, and Xiaoping Zhu. “The deformation space of geodesic tri- angulations and generalized Tutte’s embedding theorem.” Geometry & Topology 27.8 (2023): 3361-3385

2023

[2] [1]

How to morph planar graph drawings

Alamdari, Soroush, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati et al. “How to morph planar graph drawings.” SIAM Journal on Computing 46, no. 2 (2017): 824-852

2017

[3] [2]

Spaces of geodesic triangulations of the sphere

Awartani, Marwan, and David W. Henderson. “Spaces of geodesic triangulations of the sphere.” Transactions of the American Mathematical Society 304, no. 2 (1987): 721-732

1987

[4] [3]

Linear isotopies inE 2

Bing, R. H., and Michael Starbird. “Linear isotopies inE 2.” Transactions of the Amer- ican Mathematical Society 237 (1978): 205-222

1978

[5] [4]

Strictly convex simplexwise linear embeddings of a 2-disk

Bloch, Ethan D. “Strictly convex simplexwise linear embeddings of a 2-disk.” Transac- tions of the American Mathematical Society 288, no. 2 (1985): 723-737

1985

[6] [5]

The space of simplexwise linear homeomorphisms of a convex 2-disk

Bloch, Ethan D., Robert Connelly, and David W. Henderson. “The space of simplexwise linear homeomorphisms of a convex 2-disk.” Topology 23, no. 2 (1984): 161-175

1984

[7] [6]

Deformations of plane rectilinear complexes

Cairns, Steward S. “Deformations of plane rectilinear complexes.” The American Math- ematical Monthly 51, no. 5 (1944): 247-252

1944

[8] [7]

Isotopic deformations of geodesic complexes on the 2-sphere and on the plane

Cairns, Stewart S. “Isotopic deformations of geodesic complexes on the 2-sphere and on the plane.” Annals of Mathematics 45, no. 2 (1944): 207-217

1944