Sufficient conditions for the preservation of polygonal-connectedness in an arbitrary normed space
From MaRDI portal
Cites work
- A linear algorithm for finding the convex hull of a simple polygon
- Boundary Harnack principle and elliptic Harnack inequality
- Boundary Harnack principle and Martin boundary for a uniform domain
- Boundary Harnack principle on nodal domains
- Connectivity and density in the set of framelets
- Convex hulls of piecewise-smooth Jordan curves
- Convex sets in linear spaces
- Convex sets in linear spaces. II
- Martin boundary of a fractal domain
- Optimal shortest path queries in a simple polygon
- The boundary Harnack principle on optimal domains
This page was built for publication: Sufficient conditions for the preservation of polygonal-connectedness in an arbitrary normed space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6921192)