Pages that link to "Item:Q1917247"
From MaRDI portal
The following pages link to On a partition into convex polygons (Q1917247):
Displaying 47 items.
- On the number of crossing-free partitions (Q359753) (← links)
- Planar point sets with large minimum convex decompositions (Q367041) (← links)
- On pseudo-convex partitions of a planar point set (Q389454) (← links)
- The structure of optimal partitions of orthogonal polygons into fat rectangles (Q598555) (← links)
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes (Q745644) (← links)
- On partitioning rectilinear polygons into star-shaped polygons (Q808305) (← links)
- On the minimum number of mutually disjoint holes in planar point sets (Q904107) (← links)
- On the number of empty convex quadrilaterals of a finite set in the plane (Q998607) (← links)
- Partitions of planar sets into small triangles (Q1074866) (← links)
- Diameter partitioning (Q1076974) (← links)
- A Helly number for unions of two boxes in \(\mathbb R^2\) (Q1077724) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- j-partitions for visible shorelines (Q1113457) (← links)
- Partitioning linear spaces into complete quadrilaterals and \(n\)-gons (Q1339778) (← links)
- Finding convex sets among points in the plane (Q1387852) (← links)
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position. (Q1410590) (← links)
- The \(n\)-point and six-partite point of a convex polygon (Q1591894) (← links)
- Using triangles to partition a disk (Q1814017) (← links)
- On the empty convex partition of a finite set in the plane. (Q1861024) (← links)
- Perfect partitions of convex sets in the plane (Q1864188) (← links)
- Partitioning point sets in space into disjoint convex polytopes (Q1961383) (← links)
- A note on the value in the disjoint convex partition problem (Q1991778) (← links)
- Tropical combinatorial Nullstellensatz and sparse polynomials (Q2194772) (← links)
- Disjoint empty convex pentagons in planar point sets (Q2250824) (← links)
- A note on the upper bound for disjoint convex partitions (Q2342363) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- New proofs about the number of empty convex 4-gons and 5-gons in a planar point set (Q2574327) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- On \(d\)-convex partitions of polygonal regions (Q2731381) (← links)
- On polygons enclosing point sets (Q2752520) (← links)
- The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
- Divided differences of inverse functions and partitions of a convex polygon (Q3055071) (← links)
- (Q3200146) (← links)
- Partition of a plane set into a finite number of d-convex parts (Q3697704) (← links)
- (Q3786288) (← links)
- The Erdos-Szekeres problem on points in convex position – a survey (Q4501063) (← links)
- (Q4602254) (← links)
- (Q4725256) (← links)
- A Bound on a Convexity Measure for Point Sets (Q5149560) (← links)
- Specified holes with pairwise disjoint interiors in planar point sets (Q5154553) (← links)
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets (Q5302743) (← links)
- Construction and Local Routing for Angle-Monotone Graphs (Q5377357) (← links)
- Construction of a natural partition of incomplete horseshoes (Q5705495) (← links)
- Discrete and Computational Geometry (Q5897095) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901274) (← links)
- On the number of disjoint convex quadrilaterals for a planar point set (Q5952583) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)