Given a simple polygon P , we consider the problem of finding a convex polygon Q contained in P that minimizes H(P, Q), where H denotes the Hausdorff distance. We call such a polygon Q a Hausdorff core of P . We describe polynomial-time approximations for both the minimization and decision versions of the Hausdorff core problem, and we provide an argument supporting the hardness of the problem.

This paper is devoted to the investigation of cardinal invariants such as hereditary density, weak and Lindelöf number. The relation between spread extent space SP2(R,?(A)) permutation degree Hattori discussed. In particular, it shown that SP2(R,?S) contains a closed discrete subset cardinality c. Moreover, functor SPGn preserves homotopy retraction topological spaces. addition, we prove if spa...

The present paper generalises results by Lutz and Ryabko. We prove a martingale characterisation of exact Hausdorff dimension. On this base we introduce the notion of exact constructive dimension of (sets of) infinite strings. Furthermore, we generalise Ryabko’s result on the Hausdorff dimension of the set of strings having asymptotic Kolmogorov complexity ≤ α to the case of exact dimension. Th...

In this paper, we present the exact Hausdorff distance between the offset curve of quadratic Bézier curve and its quadratic GC1 approximation. To illustrate the formula for the Hausdorff distance, we give an example of the quadratic GC1 approximation of the offset curve of a quadratic Bézier curve. 1. Preliminaries Quadratic Bézier curves and their offset curves are widely used in CAD/CAM or Co...

We introduce a new measure of instability of areapreserving twist diffeomorphisms, which generalizes the notions of angle of splitting of separatrices, and flux through a gap of a Cantori. As an example of application, we establish a sharp > 0 lower bound on the topological entropy in a neighbourhood of a hyperbolic, unique action-minimizing fixed point, assuming only no topological obstruction...

We present a parallel GPU-accelerated algorithm for computing the directed Hausdorff distance from one NURBS surface to another, within a bound. We make use of axis-aligned bounding-box hierarchies that bound the NURBS surfaces to accelerate the computations. We dynamically construct as well as traverse the bounding-box hierarchies for the NURBS surfaces using operations that are optimized for ...

Symmetric branching random walk on a homogeneous tree exhibits a weak survival phase: For parameter values in a certain interval, the population survives forever with positive probability, but, with probability one, eventually vacates every finite subset of the tree. In this phase, particle trails must converge to the geometric boundary of the tree. The random subset 3 of the boundary consisti...

We investigate how planar Sobolev-Orlicz homeomorphisms map sets of Hausdorff dimension less than two. With the correct gauge functions the generalized Hausdorff measures of the image sets are shown to be zero.

Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recognition and computational chemistry. While computing the distance between a single pair of sets under the Hausdorff metric has been well studied, no results were known for the Nearest Neighbor problem under Hausdorff me...