Partition of a plane set into a finite number of d-convex parts (Q3697704)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3921385
Language Label Description Also known as
default for all languages
No label defined
    English
    Partition of a plane set into a finite number of d-convex parts
    scientific article; zbMATH DE number 3921385

      Statements

      Partition of a plane set into a finite number of d-convex parts (English)
      0 references
      0 references
      0 references
      1984
      0 references
      Euclidean plane
      0 references
      d-convexity
      0 references
      partitioning into a finite number of convex figures
      0 references
      In the Euclidean plane E consider a closed set L of directions with card(L)\(\geq 2\). Let \({\mathcal L}\) be the set of all convex figures with the property that in each smooth point the tangent line is parallel to some direction from L. If \(A\subset E\) is a connected compact set we say that A is partitioned into a finite number of figures \(M_ 1,...,M_ p\) if \(\cup^{p}_{i=1}int M_ i\subset A\subset \cup^{p}_{i=1}M_ i,\) \(int M_ i\cap int M_ j=\emptyset,\) \(i\neq j.\) The aim of this paper is to study in terms of d-convexity the following two problems: 1) The characterization of the family \({\mathcal M}\) of all the sets \(A\subset E\) admitting a partitioning into a finite number of convex figures of \({\mathcal L}\). 2) If A is a fixed element of \({\mathcal M}\), the determination of the smallest number of partitioning figures.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references