scientific article; zbMATH DE number 6789192
From MaRDI portal
Publication:5368689
Recommendations
- A linear-time algorithm for the geodesic center of a simple polygon
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
- Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
- scientific article; zbMATH DE number 4051002
- Computing the geodesic center of a simple polygon
- Geodesic center of a simple polygon using a logarithmic number of extra variables
- Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications.
- Computing the geodesic centers of a polygonal domain
Cited in
(17)- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- An algorithm for finding the Chebyshev center of a convex polyhedron
- The geodesic 2-center problem in a simple polygon
- Computing the geodesic centers of a polygonal domain
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
- A simple linear algorithm for computing rectilinear 3-centers
- The 2-center problem in a simple polygon
- scientific article; zbMATH DE number 4051002 (Why is no real title available?)
- On the geodesic centers of polygonal domains
- Geodesic center of a simple polygon using a logarithmic number of extra variables
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
- Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
- Computing the geodesic center of a simple polygon
- The Visibility Center of a Simple Polygon
- The geodesic edge center of a simple polygon
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
- A linear-time algorithm for the geodesic center of a simple polygon
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368689)
