PLANAR STRONG VISIBILITY
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3028862 (Why is no real title available?)
- A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
- A linear algorithm for finding the convex hull of a simple polygon
- An Optimal Algorithm for Finding the Kernel of a Polygon
- An efficient algorithm for determining the convex hull of a finite planar set
- Dynamic C-oriented polygonal intersection searching
- Fundamentals of restricted-orientation convexity
- Generalized halfspaces in restricted-orientation convexity
- On Some Distance Problems in Fixed Orientations
- On the X-Y convex hull of a set of X-Y polygons
- On the definition and computation of rectilinear convex hulls
- Optimal algorithms to compute the closure of a set of iso-rectangles
- Optimal computation of finitely oriented convex hulls
- Restricted-oriented convex sets
- Strong restricted-orientation convexity
Cited in
(3)
This page was built for publication: PLANAR STRONG VISIBILITY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818579)
