Piercing unit geodesic disks
From MaRDI portal
Cites work
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- A new data structure for shortest path queries in a simple polygon
- A subexponential bound for linear programming
- Ausgewählte Einzelprobleme der kombinatorischen Geometrie in der Ebene
- Computing depth orders for fat objects and related problems
- 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?)
- On point covers of c-oriented polygons
- Optimal shortest path queries in a simple polygon
- Piercing pairwise intersecting convex shapes in the plane
- Piercing pairwise intersecting geodesic disks
- Piercing pairwise intersecting geodesic disks by five points
- Recognizing weakly simple polygons
- Simple linear time algorithms for piercing pairwise intersecting disks
- Stabbing pairwise intersecting disks by five points
- Stabbing pairwise intersecting disks by four points
- The Jordan-Schonflies Theorem and the Classification of Surface
- Über Mengen konvexer Körper mit gemeinschaftlichen Punkten.
- Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten.
This page was built for publication: Piercing unit geodesic disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869429)