scientific article; zbMATH DE number 753970

MaRDI QIDQ4698691zbMATH OpenFDO

Authors Sven Schuierer

Publication date 11 May 1995

zbMATH Keywords

computational geometrypolygonsvisibilitykernel computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An O(log log n) algorithm to compute the kernel of a polygon
• A new algorithm for finding the kernel of a simple polygon
• scientific article; zbMATH DE number 619546
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
• scientific article; zbMATH DE number 140464
• scientific article; zbMATH DE number 4045150
• A new O(n \,n) algorithm for computing the intersection of convex polygons
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• scientific article; zbMATH DE number 1256697

Cited in

(3)

• An O(log log n) algorithm to compute the kernel of a polygon
• scientific article; zbMATH DE number 140464 (Why is no real title available?)
• A new algorithm for finding the kernel 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 Q4698691)