Graph-Theoretic Solutions to Computational Geometry Problems

DOI10.1007/978-3-642-11409-0_1MaRDI QIDQ5851089zbMATH OpenOpenAlexFDO

Authors David Eppstein

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The geometry of graphs and some of its algorithmic applications
• Towards a Theory of Geometric Graphs
• scientific article; zbMATH DE number 1342089
• On Some Applications of Graph Theory to Geometry
• scientific article; zbMATH DE number 1444288
• Applications of graph and hypergraph theory in geometry
• scientific article; zbMATH DE number 1033560
• scientific article; zbMATH DE number 4060718
• scientific article; zbMATH DE number 1985283
• Geometric algorithms and combinatorial optimization

Cited in

(20)

• Morphological decomposition and compression of binary images via a minimum set cover algorithm
• Sequential sampling of junction trees for decomposable graphs
• Approximating the bundled crossing number
• A computational complexity comparative study of graph tessellation problems
• Rectangle transformation problem
• Approximation algorithms for decomposing octilinear polygons
• Fair multi-cake cutting
• scientific article; zbMATH DE number 437554 (Why is no real title available?)
• Solving cheap graph problems on Meshes
• Efficient Algorithms for Geometric Graph Search Problems
• Counting Blanks in Polygonal Arrangements
• Extending Partial Orthogonal Drawings
• Extending partial orthogonal drawings
• The Geometry of Computation-Graph Abstraction
• Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
• Approximating the Bundled Crossing Number
• Orthogonal dissection into few rectangles
• Dominating set, independent set, discrete k-center, dispersion, and related problems for planar points in convex position
• The maximum clique problem in a disk graph made easy
• Finding a maximum clique in a disk graph

This page was built for publication: Graph-Theoretic Solutions to Computational Geometry Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5851089)