scientific article; zbMATH DE number 1424299

From MaRDI portal
Publication:4945512

zbMath0948.68189MaRDI QIDQ4945512

J. Mark Keil

Publication date: 29 August 2000


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Fair and square: cake-cutting in two dimensionsUniversal Guard ProblemsNote on covering monotone orthogonal polygons with star-shaped polygonsMinimum K-Adjacent Rectangles of Orthogonal Polygons and its ApplicationConvex Partitions with 2-Edge Connected Dual GraphsFair multi-cake cuttingExact and approximation algorithms for computing optimal fat decompositionsThe structure of optimal partitions of orthogonal polygons into fat rectangles3D Rectangulations and Geometric Matrix MultiplicationCounting Blanks in Polygonal ArrangementsRectangle transformation problemApproximation algorithms for decomposing octilinear polygonsOn geometric shape construction via growth operationsKeep your distance: land division with separationOn geometric shape construction via growth operationsCARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACESA combinatorial property on angular orders of plane point setsOn \(k\)-convex polygons3D rectangulations and geometric matrix multiplicationMorphological decomposition and compression of binary images via a minimum set cover algorithmConvex partitions with 2-edge connected dual graphsComputing the Fréchet distance between simple polygonsCutting polygons into small pieces with chords: Laser-based localizationOn guarding the vertices of rectilinear domainsWeighted skeletons and fixed-share decompositionApproximate convex decomposition of polygonsPolygon decomposition for efficient construction of Minkowski sumsLinear-Time 3-Approximation Algorithm for the r-Star Covering ProblemApproximate convex decomposition of polyhedra and its applicationsCompressed algebraic cubature over polygons with applications to optical designClose-to-optimal algorithm for rectangular decomposition of 3D shapesDecompositions and boundary coverings of non-convex fat polyhedraLower bounds for approximate polygon decomposition and minimum gap