Staircase visibility and computation of kernels

DOI10.1007/BF01300371zbMath0837.68119MaRDI QIDQ1894710

Derick Wood, Sven Schuierer

Publication date: 24 July 1995

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

computational geometrykernel problemrestricted orientation geometry

Mathematics Subject Classification ID

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

Related Items (2)

Fundamentals of restricted-orientation convexity ⋮ Finding minimum witness sets in orthogonal polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering orthogonal polygons with star polygons: The perfect graph approach
• On the X-Y convex hull of a set of X-Y polygons
• The orthogonal convex skull problem
• A linear algorithm for finding the convex hull of a simple polygon
• Visibility in semi-convex spaces
• Optimal computation of finitely oriented convex hulls
• Orthogonally convex covering of orthogonal polygons without holes
• A new linear convex hull algorithm for simple polygons (Corresp.)
• On finding the convex hull of a simple polygon
• The Ultimate Planar Convex Hull Algorithm?
• On rectangular visibility
• Perfect Graphs and Orthogonally Convex Covers
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Finding the convex hull of a simple polygon

This page was built for publication: Staircase visibility and computation of kernels