Jordan Areas and Grids
From MaRDI portal
Publication:4918015
DOI10.1016/j.entcs.2008.12.017zbMath1262.03090MaRDI QIDQ4918015
Zhao, Xishun, Norbert Th. Müller
Publication date: 3 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.017
03D78: Computation over the reals, computable analysis
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time computable curve whose interior has a nonrecursive measure
- On the complexity of computing the logarithm and square root functions on a complex domain
- The constructive Jordan curve theorem
- An effective Riemann Mapping Theorem
- On the complexity of finding paths in a two-dimensional domain I: Shortest paths
- Computational Complexity of Two-Dimensional Regions
- Complexity of Operators on Compact Sets
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
- Jordan Curves with Polynomial Inverse Moduli of Continuity
- Some complexity issues on the simply connected regions of the two-dimensional plane