Computing external farthest neighbors for a simple polygon
From MaRDI portal
Recommendations
- Computing geodesic furthest neighbors in simple polygons
- scientific article; zbMATH DE number 1796963
- PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS
- Computing farthest neighbors on a convex polytope.
- A linear time algorithm for finding all farthest neighbors in a convex polygon
- scientific article; zbMATH DE number 4080989
- Computing the extreme distances between two convex polygons
- Computing the Fréchet distance between simple polygons
- Computing the external geodesic diameter of a simple polygon
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
Cites work
- Computing geodesic furthest neighbors in simple polygons
- Computing the external geodesic diameter of a simple polygon
- Computing the geodesic center of a simple polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- Finding the convex hull of a simple polygon
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Optimal shortest path queries in a simple polygon
- Worst-case data structures for the priority queue with attrition
Cited in
(8)- Parallel methods for visibility and shortest-path problems in simple polygons
- Computing geodesic furthest neighbors in simple polygons
- Computing the external geodesic diameter of a simple polygon
- PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS
- A linear time algorithm for finding all farthest neighbors in a convex polygon
- Guarding Exterior Region of a Simple Polygon
- Computing the longest diagonal of a simple polygon
- Efficient piecewise-linear function approximation using the uniform metric
This page was built for publication: Computing external farthest neighbors for a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175781)
