Pages that link to "Item:Q4210148"

The following pages link to Unoriented $Theta$-Maxima in the Plane: Complexity and Algorithms (Q4210148):

Displaying 9 items.

• Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
• Separating bichromatic point sets by L-shapes (Q904108) (← links)
• Finding the \(\Theta \)-guarded region (Q1037785) (← links)
• On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299) (← links)
• Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (Q2022326) (← links)
• Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
• Rectilinear Convex Hull with Minimum Area (Q4899283) (← links)
• Rectilinear convex hull of points in 3D and applications (Q6618155) (← links)