Computing the L _1 geodesic diameter and center of a simple polygon in linear time
DOI10.1007/978-3-642-54423-1_11zbMATH Open1405.68395OpenAlexW2571277849MaRDI QIDQ5405033FDOQ5405033
Authors: Sang Won Bae, Yoshio Okamoto, Haitao Wang, Matias Korman 
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_11
Recommendations
- 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 polygonal domain
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
- scientific article; zbMATH DE number 6789192
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (7)
- 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 L 1-diameter and center of a simple rectilinear polygon in parallel
- Title not available (Why is that?)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
This page was built for publication: Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405033)
