The following pages link to (Q5368689):
Displaying 12 items.
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (Q679748) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon (Q1193703) (← links)
- Finding the medial axis of a simple polygon in linear time (Q1289244) (← links)
- An algorithm for finding the Chebyshev center of a convex polyhedron (Q1317311) (← links)
- The geodesic 2-center problem in a simple polygon (Q1615885) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
