Computational Complexity of Two-Dimensional Regions
From MaRDI portal
Recommendations
- The computational complexity of distance functions of two-dimensional domains
- On the complexity of computing the Hausdorff distance
- On the complexity of convex hulls of subsets of the two-dimensional plane
- scientific article; zbMATH DE number 2063224
- Jordan curves with polynomial inverse moduli of continuity
Cited in
(20)- Computable invariance
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- On the computability of fractal dimensions and Hausdorff measure
- A theory of complexity for continuous time systems
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
- The computational complexity of densest region detection
- On the complexity of computing the Hausdorff distance
- In Memoriam: Ker-I Ko (1950–2018)
- Who asked us? How the theory of computing answers questions about analysis
- On parallel complexity of analytic functions
- A geometric algorithm for winding number computation with complexity analysis
- Jordan Areas and Grids
- Complexity of operators on compact sets
- On the complexity of convex hulls of subsets of the two-dimensional plane
- On the complexity of the pancake problem
- Jordan curves with polynomial inverse moduli of continuity
- The computational complexity of distance functions of two-dimensional domains
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
- On the complexity of computing the logarithm and square root functions on a complex domain
- Jordan curves with polynomial inverse moduli of continuity
This page was built for publication: Computational Complexity of Two-Dimensional Regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857588)
