On the empty convex partition of a finite set in the plane.
type: Item
instance of: scholarly article
title: On the empty convex partition of a finite set in the plane.
zbMATH Open document ID: 1034.52015
DOI: 10.1142/S0252959902000456
author: Changqing Xu
author: Ren Ding
published in: Chinese Annals of Mathematics. Series B
publication date: 2002-01-01T00:00:00Z
review text: The authors discuss partitions of a finite set of points in the plane into empty convex polygons and into disjoint convex polygons. They improve upper and lower bounds in enumeration problems stated in [\textit{M. Urabe}, Discrete Appl. Math. 64, 179--191 (1996; Zbl 0849.52015)].
reviewed by: Arnfried Kemnitz
Mathematics Subject Classification ID: 52C10
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 1877202
zbMATH Keywords: partition
zbMATH Keywords: disjoint partition
zbMATH Keywords: empty partition
MaRDI profile type: Publication
cites work: Sets with No Empty Convex 7-Gons
cites work: On a partition into convex polygons
Recommended article: Q4388339
Recommended article: Partition of a plane set into a finite number of d-convex parts
Recommended article: Perfect partitions of convex sets in the plane
Recommended article: On the number of empty convex quadrilaterals of a finite set in the plane
Recommended article: Q4469862
Recommended article: On empty convex polygons in a planar point set
Recommended article: On pseudo-convex partitions of a planar point set
Recommended article: Q3732018
Recommended article: On empty convex polytopes
description: scientific article; zbMATH DE number 1877202