Cutting disjoint disks by straight lines
From MaRDI portal
Publication:2640143
Recommendations
- Cutting a set of disks by a line with leaving many intact disks in both sides
- Cuttings for Disks and Axis-Aligned Rectangles
- Cuttings for disks and axis-aligned rectangles in three-space
- Optimally cutting a surface into a disk
- Optimally cutting a surface into a disk
- On disconnected cuts and separators
- Rectilinear glass-cut dissections of rectangles to squares
- Separating convex sets by straight lines
- On Isolating Points Using Disks
- Crazy Cuts: Dissecting Planar Shapes into Two Identical Parts
Cited in
(18)- Separating convex sets in the plane
- Separation of convex sets
- Separating translates in the plane: Combinatorial bounds and an algorithm
- Intersecting convex sets by rays
- Optimally cutting a surface into a disk
- The geometry of graphs and some of its algorithmic applications
- Illuminating high-dimensional convex sets
- Balanced line separators of unit disk graphs
- SLIDING DISKS IN THE PLANE
- Piercing a set of disjoint balls by a line
- Cuttings for Disks and Axis-Aligned Rectangles
- Cutting out polygon collections with a saw
- Cutting a bunch of grapes by a plane
- Piercing balls sitting on a table by a vertical line
- Separating collections of points in Euclidean spaces
- Cutting glass
- Allowable interval sequences and separating convex sets in the plane
- Cutting a set of disks by a line with leaving many intact disks in both sides
This page was built for publication: Cutting disjoint disks by straight lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640143)
