On the X-Y convex hull of a set of X-Y polygons
From MaRDI portal
Publication:1056548
DOI10.1007/BF01933620zbMath0523.68061WikidataQ29543976 ScholiaQ29543976MaRDI QIDQ1056548
Publication date: 1983
Published in: BIT (Search for Journal in Brave)
image processing; VLSI; convex hulls; efficient algorithms; building blocks; circuit layout; rectilinear polygons; wire routing; 23, 456-471 (1983)
52A10: Convex sets in (2) dimensions (including convex curves)
68R99: Discrete mathematics in relation to computer science
Related Items
ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS, PLANAR STRONG VISIBILITY, Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations, The contour problem for rectilinear polygons, On the definition and computation of rectilinear convex hulls, Computing minimum-area rectilinear convex hull and \(L\)-shape, Optimization on directionally convex sets, Partitioning and separating sets of orthogonal polygons, A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets, Parallel rectilinear shortest paths with rectangular obstacles, Generalized halfspaces in restricted-orientation convexity, On parallel rectilinear obstacle-avoiding paths, Fundamentals of restricted-orientation convexity, Optimal computation of finitely oriented convex hulls, Staircase visibility and computation of kernels
Cites Work
