Piercing pairwise intersecting geodesic disks
From MaRDI portal
Publication:2230402
Recommendations
Cites work
- A linear-time algorithm for the geodesic center of a simple polygon
- A new data structure for shortest path queries in a simple polygon
- A subexponential bound for linear programming
- Computing the geodesic center of a simple polygon
- Geodesic-preserving polygon simplification
- 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 3219448 (Why is no real title available?)
- Optimal shortest path queries in a simple polygon
- Recognizing weakly simple polygons
- Some computational aspects of geodesic convex sets in a simple polygon
- Stabbing pairwise intersecting disks by five points
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
Cited in
(7)- Stabbing pairwise intersecting disks by five points
- Piercing pairwise intersecting geodesic disks by five points
- Side disks of a spherical great polygon
- Stabbing pairwise intersecting disks by five points
- A Note on Piercing a Disk
- Simple linear time algorithms for piercing pairwise intersecting disks
- Piercing unit geodesic disks
This page was built for publication: Piercing pairwise intersecting geodesic disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230402)