Pages that link to "Item:Q1820432"
From MaRDI portal
The following pages link to Optimal computation of finitely oriented convex hulls (Q1820432):
Displaying 20 items.
- Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- Restricted-oriented convex sets (Q1174335) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- Generalized halfspaces in restricted-orientation convexity (Q1266488) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Fundamentals of restricted-orientation convexity (Q1373390) (← links)
- Oracle-polynomial-time approximation of largest simplices in convex bodies (Q1574577) (← links)
- On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299) (← links)
- A decompositin theorem for convexity spaces (Q1826114) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- Computing min-convex hulls in the affine building of \(\mathrm{SL}_d\) (Q2022629) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Angle-restricted tours in the plane. (Q2482907) (← links)
- Efficient Computation of the Outer Hull of a Discrete Path (Q3190071) (← links)
- (Q3514520) (← links)
- (Q4606269) (← links)
- PLANAR STRONG VISIBILITY (Q4818579) (← links)
- Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)
