PLANAR STRONG VISIBILITY
From MaRDI portal
Publication:4818579
DOI10.1142/S0218195903001116zbMath1101.68905MaRDI QIDQ4818579
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- On the definition and computation of rectilinear convex hulls
- On the X-Y convex hull of a set of X-Y polygons
- A linear algorithm for finding the convex hull of a simple polygon
- Restricted-oriented convex sets
- Generalized halfspaces in restricted-orientation convexity
- Fundamentals of restricted-orientation convexity
- Strong restricted-orientation convexity
- Optimal computation of finitely oriented convex hulls
- An efficient algorithm for determining the convex hull of a finite planar set
- 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
- An Optimal Algorithm for Finding the Kernel of a Polygon
This page was built for publication: PLANAR STRONG VISIBILITY
