A new algorithm for finding the kernel of a simple polygon

MaRDI QIDQ3538447zbMATH OpenFDO

Authors Zehua Lu, Guanghui Liu, Chuan-Bo Chen

Publication date 24 November 2008

zbMATH Keywords

automatical selectclipkernelsimple polygon

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An O(log log n) algorithm to compute the kernel of a polygon
• scientific article; zbMATH DE number 753970
• scientific article; zbMATH DE number 140464
• Multiple-guard kernels of simple polygons
• On finding the convex hull of a simple polygon

Cited in

(3)

• An efficient algorithm for finding the CSG representation of a simple polygon
• scientific article; zbMATH DE number 753970 (Why is no real title available?)
• An O(log log n) algorithm to compute the kernel of a polygon

This page was built for publication: A new algorithm for finding the kernel of a simple polygon

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