Pages that link to "Item:Q802314"

The following pages link to On the definition and computation of rectilinear convex hulls (Q802314):

Displaying 34 items.

• Optimal time-convex hull for a straight-line highway in \(L_p\)-metrics (Q265715) (← links)
• Covering points with minimum/maximum area orthogonally convex polygons (Q283887) (← links)
• From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
• Covering points with orthogonal polygons (Q496708) (← links)
• Covering points with orthogonally convex polygons (Q543785) (← links)
• Reconstructing orthogonal polyhedra from putative vertex sets (Q634249) (← links)
• Planar location problems with block distance and barriers (Q816413) (← links)
• Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
• On the power of safe locking (Q909495) (← links)
• Highway hull revisited (Q1037778) (← links)
• Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
• The orthogonal convex skull problem (Q1102544) (← links)
• Restricted-oriented convex sets (Q1174335) (← links)
• Generalized halfspaces in restricted-orientation convexity (Q1266488) (← links)
• Fundamentals of restricted-orientation convexity (Q1373390) (← links)
• On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299) (← links)
• Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
• Set-valued games and mixed-strategy equilibria in discounted supergames (Q1727718) (← links)
• Optimal computation of finitely oriented convex hulls (Q1820432) (← links)
• A decompositin theorem for convexity spaces (Q1826114) (← links)
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (Q2022326) (← links)
• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set (Q2242054) (← links)
• Separability of imprecise points (Q2362104) (← links)
• A fast and efficient algorithm for determining the connected orthogonal convex hulls (Q2671859) (← links)
• Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
• Linear optimization with fuzzy variable over fuzzy polytope (Q2953524) (← links)
• PLANAR STRONG VISIBILITY (Q4818579) (← links)
• Rectilinear Convex Hull with Minimum Area (Q4899283) (← links)
• Set estimation under biconvexity restrictions (Q5140341) (← links)
• Maximum Rectilinear Convex Subsets (Q5149759) (← links)
• Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations (Q5387812) (← links)
• The rectilinear convex hull of line segments (Q6546584) (← links)
• Rectilinear convex hull of points in 3D and applications (Q6618155) (← links)
• Generalized Nash equilibrium problems with mixed-integer variables (Q6665384) (← links)