Fundamentals of restricted-orientation convexity
From MaRDI portal
(Redirected from Publication:1373390)
Recommendations
Cites work
- scientific article; zbMATH DE number 4062042 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- A decompositin theorem for convexity spaces
- A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
- Dynamic C-oriented polygonal intersection searching
- Generalized halfspaces in restricted-orientation convexity
- Local Convexity and L n Sets
- On L n Sets, the Hausdorff Metric, and Connectedness
- 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
- Staircase visibility and computation of kernels
- Strong restricted-orientation convexity
- What is a Convex Set?
Cited in
(11)- Computing D-convex hulls in the plane
- scientific article; zbMATH DE number 4062042 (Why is no real title available?)
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- PLANAR STRONG VISIBILITY
- Properties of connected ortho-convex sets in the plane
- On a conjecture of Fink and Wood
- Restricted-orientation convexity.
- On k-convex polygons
- Determination of Q-convex bodies by X-rays
- Orientation of convex sets
- scientific article; zbMATH DE number 4067744 (Why is no real title available?)
This page was built for publication: Fundamentals of restricted-orientation convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373390)