On the X-Y convex hull of a set of X-Y polygons

From MaRDI portal
Publication:1056548

DOI10.1007/BF01933620zbMath0523.68061WikidataQ29543976 ScholiaQ29543976MaRDI QIDQ1056548

J. Blot

Publication date: 1983

Published in: BIT (Search for Journal in Brave)




Related Items (21)

Computing minimum-area rectilinear convex hull and \(L\)-shapeStaircase visibility and computation of kernelsPartitioning and separating sets of orthogonal polygonsPLANAR STRONG VISIBILITYFundamentals of restricted-orientation convexityA fast and efficient algorithm for determining the connected orthogonal convex hullsSeparating bichromatic point sets in the plane by restricted orientation convex hullsMaintaining Extremal Points and Its Applications to Deciding Optimal OrientationsSet-valued games and mixed-strategy equilibria in discounted supergamesA linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point setsParallel rectilinear shortest paths with rectangular obstaclesA modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point setRealistic roofs without local minimum edges over a rectilinear polygonEfficient computation of minimum-area rectilinear convex hull under rotation and generalizationsON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHSGeneralized halfspaces in restricted-orientation convexityOptimization on directionally convex setsOptimal computation of finitely oriented convex hullsThe contour problem for rectilinear polygonsOn the definition and computation of rectilinear convex hullsOn parallel rectilinear obstacle-avoiding paths



Cites Work


This page was built for publication: On the X-Y convex hull of a set of X-Y polygons