Optimal computation of finitely oriented convex hulls

DOI10.1016/0890-5401(87)90045-9zbMath0615.52001OpenAlexW1966582767MaRDI QIDQ1820432

Derick Wood, Gregory J. E. Rawlins

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90045-9

zbMATH Keywords

convex hulloptimal algorithmsF-convexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52Bxx)

Related Items (13)

Computing minimum length paths of a given homotopy class ⋮ Staircase visibility and computation of kernels ⋮ Partitioning and separating sets of orthogonal polygons ⋮ PLANAR STRONG VISIBILITY ⋮ Fundamentals of restricted-orientation convexity ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ On the \(\mathcal{O}_\beta\)-hull of a planar point set ⋮ Minimum-link paths revisited ⋮ Restricted-oriented convex sets ⋮ Angle-restricted tours in the plane. ⋮ Generalized halfspaces in restricted-orientation convexity ⋮ The intersection searching problem for c-oriented polygons ⋮ A decompositin theorem for convexity spaces

Cites Work

• 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
• On the identification of the convex hull of a finite set of points in the plane
• A new linear convex hull algorithm for simple polygons (Corresp.)
• On finding the convex hull of a simple polygon
• Dynamic C-oriented polygonal intersection searching
• Finding the convex hull of a simple polygon
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal computation of finitely oriented convex hulls