On convex partitions of polygonal regions (Q1296981): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5617548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excursions into combinatorial geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimality of polygon triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal rectangular partitions of digitized blobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum convex partition of a polygon with holes by cuts in given directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum convex partition of polygonal domains by guillotine cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of a Theorem of Tietze and Nakajima on Local Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition of a plane set into a finite number of d-convex parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805803 / rank
 
Normal rank

Latest revision as of 20:30, 28 May 2024

scientific article
Language Label Description Also known as
English
On convex partitions of polygonal regions
scientific article

    Statements

    On convex partitions of polygonal regions (English)
    0 references
    0 references
    0 references
    3 August 1999
    0 references
    Let \(M\subset E^2\) be an open, connected and bounded polygonal region with polygonal holes (also holes of dimensions smaller than 2 are possible). Points \(x_1,\dots,x_n\) in the boundary of \(M\) are given. Moreover, for each \(x_i\), we are given a finite set of oriented directions \(L^i_j\), where \(j\in\{1,\dots, \mu_i\}\). The authors consider partitions of \(M\) into convex parts. They require that for every \(x_i\) and for every \(L^i_j\), the boundary of the partition contains a segment with end-point \(x_i\) and of direction \(L^i_j\). The paper derives the minimal number of parts in a partition of \(M\) fulfilling the above presented conditions.
    0 references
    0 references
    polygonal region
    0 references
    partitions
    0 references

    Identifiers