scientific article
From MaRDI portal
Publication:3893361
zbMath0447.68110MaRDI QIDQ3893361
Cristina Mugnai, Elena Lodi, Witold jun. Lipski, Linda Pagli, Fabrizio Luccio
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational geometrydata organizationbidimensional memorycomputational complexity of geometrical problemsdecomposition into disjoint rectangles
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)
Related Items (15)
Quadrangulations of planar sets ⋮ Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application ⋮ A unified approach to layout wirability ⋮ Characterizing and efficiently computing quadrangulations of planar point sets ⋮ Approximation algorithms for decomposing octilinear polygons ⋮ Minimum k-partitioning of rectilinear polygons ⋮ Morphological decomposition and compression of binary images via a minimum set cover algorithm ⋮ Algorithms for the decomposition of a polygon into convex polygons ⋮ Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles ⋮ On heuristics for minimum length rectilinear partitions ⋮ Orthogonal dissection into few rectangles ⋮ Close-to-optimal algorithm for rectangular decomposition of 3D shapes ⋮ Approximation algorithms for partitioning a rectangle with interior points ⋮ On partitioning rectilinear polygons into star-shaped polygons ⋮ Rectangular partition is polynomial in two dimensions but NP-complete in three
This page was built for publication:
