Bounds for the CRDT conformal mapping algorithm
From MaRDI portal
Publication:977103
DOI10.1007/BF03321771zbMath1196.30004MaRDI QIDQ977103
Publication date: 17 June 2010
Published in: Computational Methods and Function Theory (Search for Journal in Brave)
hyperbolic geometryquasiconformal mappingsnumerical conformal mappingCRDT algorithmSchwarz-Christoffel formula
General theory of conformal mappings (30C35) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Quasiconformal mappings in the complex plane (30C62) Schwarz-Christoffel-type mappings (30C30)
Related Items (1)
Uses Software
Cites Work
- Delaunay graphs are almost as good as complete graphs
- Classes of graphs which approximate the complete Euclidean graph
- Quasiconformal maps in metric spaces with controlled geometry
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Quasiconformal Lipschitz maps, Sullivan's convex hull theorem and Brennan's conjecture
- Quasiconformal homeomorphisms and the convex hull boundary
- The logarithmic spiral: A counterexample to the \(K=2\) conjecture
- Complex earthquakes and deformations of the unit disk
- On Optimal Interpolation Triangle Incidences
- Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation
- A Multipole Method for Schwarz--Christoffel Mapping of Polygons with Thousands of Sides
- Divergence groups have the Bowen property
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds for the CRDT conformal mapping algorithm
