Fundamentals of restricted-orientation convexity
From MaRDI portal
Publication:1373390
DOI10.1016/0020-0255(96)00056-4zbMath0885.52002OpenAlexW2041547874MaRDI QIDQ1373390
Publication date: 17 December 1997
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: http://repository.ust.hk/ir/bitstream/1783.1-56/1/tr9546.pdf
Axiomatic and generalized convexity (52A01) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (5)
PLANAR STRONG VISIBILITY ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ On \(k\)-convex polygons ⋮ Computing \(D\)-convex hulls in the plane ⋮ Determination of Q-convex bodies by X-rays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the definition and computation of rectilinear convex hulls
- On the X-Y convex hull of a set of X-Y polygons
- Restricted-oriented convex sets
- Generalized halfspaces in restricted-orientation convexity
- Strong restricted-orientation convexity
- Optimal computation of finitely oriented convex hulls
- A decompositin theorem for convexity spaces
- Staircase visibility and computation of kernels
- On Some Distance Problems in Fixed Orientations
- Optimal algorithms to compute the closure of a set of iso-rectangles
- Dynamic C-oriented polygonal intersection searching
- A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
- On L n Sets, the Hausdorff Metric, and Connectedness
- Local Convexity and L n Sets
- What is a Convex Set?
This page was built for publication: Fundamentals of restricted-orientation convexity