Simple linear time algorithms for piercing pairwise intersecting disks
From MaRDI portal
Publication:6110069
Recommendations
Cites work
- A subexponential bound for linear programming
- Ausgewählte Einzelprobleme der kombinatorischen Geometrie in der Ebene
- scientific article; zbMATH DE number 4017764 (Why is no real title available?)
- scientific article; zbMATH DE number 3156887 (Why is no real title available?)
- scientific article; zbMATH DE number 3971629 (Why is no real title available?)
- scientific article; zbMATH DE number 49381 (Why is no real title available?)
- scientific article; zbMATH DE number 3219448 (Why is no real title available?)
- Largest bounding box, smallest diameter, and related problems on imprecise points
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Piercing pairwise intersecting geodesic disks
- Stabbing pairwise intersecting disks by five points
- Stabbing pairwise intersecting disks by five points
Cited in
(12)- Intersection queries in sets of disks
- Stabbing pairwise intersecting disks by five points
- Piercing pairwise intersecting geodesic disks
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
- scientific article; zbMATH DE number 1254001 (Why is no real title available?)
- ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS
- Stabbing pairwise intersecting disks by five points
- Stabbing pairwise intersecting disks by four points
- Piercing pairwise intersecting convex shapes in the plane
- Piercing diametral disks induced by edges of maximum spanning trees
- Piercing unit geodesic disks
- On piercing sets of axis-parallel rectangles and rings
This page was built for publication: Simple linear time algorithms for piercing pairwise intersecting disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110069)