Graph-Theoretic Solutions to Computational Geometry Problems
From MaRDI portal
Publication:5851089
DOI10.1007/978-3-642-11409-0_1zbMath1273.68391OpenAlexW1906492141MaRDI QIDQ5851089
Publication date: 21 January 2010
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_1
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (11)
Approximating the bundled crossing number ⋮ Fair multi-cake cutting ⋮ Extending Partial Orthogonal Drawings ⋮ Counting Blanks in Polygonal Arrangements ⋮ Rectangle transformation problem ⋮ Approximation algorithms for decomposing octilinear polygons ⋮ Approximating the Bundled Crossing Number ⋮ Morphological decomposition and compression of binary images via a minimum set cover algorithm ⋮ Close-to-optimal algorithm for rectangular decomposition of 3D shapes ⋮ Sequential sampling of junction trees for decomposable graphs ⋮ Extending Partial Orthogonal Drawings
This page was built for publication: Graph-Theoretic Solutions to Computational Geometry Problems
