scientific article; zbMATH DE number 753970

zbMATH Open0817.68129MaRDI QIDQ4698691FDOQ4698691

Authors: Sven Schuierer 

Publication date: 11 May 1995

Title of this publication is not available (Why is that?)

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\(\cdot \log \,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

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)

Cited In (3)

• Title not available (Why is that?)
• A new algorithm for finding the kernel of a simple polygon
• An O(log log n) algorithm to compute the kernel of a 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)