Counting disjoint 2-partitions for points in the plane

DOI10.1016/j.dam.2007.05.012zbMath1123.05011OpenAlexW2004787924MaRDI QIDQ2384393

Yanyan Li

Publication date: 21 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.012

zbMATH Keywords

countingoptimal partitionssortabilitydisjoint partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Cites Work

• Optimal partitions having disjoint convex and conic hulls
• Separable partitions
• Vertex characterization of partition polytopes of bipartitions and of planar point sets
• Sortability of vector partitions
• Geometric clusterings
• A Polynomial Time Algorithm for Shaped Partition Problems
• The number of partitions of a set of N points in k dimensions induced by hyperplanes

This page was built for publication: Counting disjoint 2-partitions for points in the plane