Covering convex sets with non-overlapping polygons

DOI10.1016/0012-365X(90)90147-AzbMath0698.52009MaRDI QIDQ912393

Arch D. Robison, Xiao-Jun Shen, Herbert Edelsbrunner

Publication date: 1990

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

zbMATH Keywords

triangulationgraphcoveringconvex polygonconvex compactatransversal problem

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items

Geometric clustering in normed planes, Separation and approximation of polyhedral objects, Counting Blanks in Polygonal Arrangements, Minimum clique partition in unit disk graphs, Allowable interval sequences and separating convex sets in the plane, Geometric orderings of intersecting translates and their applications, New results on the coarseness of bicolored point sets, Geometric Knapsack problems, Three-clustering of points in the plane., Mathematical characterizations and computational complexity of anti-slide puzzles, Mathematical characterizations and computational complexity of anti-slide puzzles, Separable partitions

Cites Work

• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• Geometric permutations and common transversals
• Zerlegung von Dreiecken in Dreiecke mit Nebenbedingung. (Partition of triangles into subtriangles with side-conditions)
• Geometric permutations for convex sets