Geodesic center of a simple polygon using a logarithmic number of extra variables

DOI10.3233/FI-2019-1844MaRDI QIDQ4973847zbMATH OpenOpenAlexFDO

Authors Pardis Kavand, Ali Mohades

Publication date 6 December 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2019-1844

zbMATH Keywords

computational geometrygeodesic centergeodesic farthest neighborgeodesic farthest-site Voronoi diagrammemory-constrained algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 4051002
• Computing the geodesic center of a simple polygon
• scientific article; zbMATH DE number 6789192
• A linear-time algorithm for the geodesic center of a simple polygon
• Computing the geodesic centers of a polygonal domain

Cited in

(3)

• scientific article; zbMATH DE number 6789192 (Why is no real title available?)
• Computing the geodesic center of a simple polygon
• The geodesic edge center of a simple polygon

This page was built for publication: Geodesic center of a simple polygon using a logarithmic number of extra variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973847)