Staircase visibility and computation of kernels
type: Item
instance of: scholarly article
title: Staircase visibility and computation of kernels
zbMATH Open document ID: 0837.68119
DOI: 10.1007/BF01300371
author: Sven Schuierer
author: D. Wood
published in: Algorithmica
publication date: 1995-07-24T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 778423
zbMATH Keywords: restricted orientation geometry
zbMATH Keywords: computational geometry
zbMATH Keywords: kernel problem
MaRDI profile type: Publication
cites work: A new linear convex hull algorithm for simple polygons (Corresp.)
cites work: Orthogonally convex covering of orthogonal polygons without holes
cites work: Q3772828
cites work: Finding the convex hull of a simple polygon
cites work: The Ultimate Planar Convex Hull Algorithm?
cites work: On finding the convex hull of a simple polygon
cites work: An Optimal Algorithm for Finding the Kernel of a Polygon
cites work: A linear algorithm for finding the convex hull of a simple polygon
cites work: Covering orthogonal polygons with star polygons: The perfect graph approach
cites work: Perfect Graphs and Orthogonally Convex Covers
cites work: On the X-Y convex hull of a set of X-Y polygons
cites work: Q4692465
cites work: On rectangular visibility
cites work: Q3694703
cites work: Optimal computation of finitely oriented convex hulls
cites work: Q3800653
cites work: Q3796310
cites work: Q3973281
cites work: Visibility in semi-convex spaces
cites work: The orthogonal convex skull problem
description: scientific article; zbMATH DE number 778423