Algorithms and Computation

DOI10.1007/b104582zbMath1116.68628OpenAlexW2491382297MaRDI QIDQ5712142

Marcus Schaefer, Peter Hui

Publication date: 22 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104582

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

On compatible triangulations with a minimum number of Steiner points ⋮ On compatible matchings ⋮ On the red/blue spanning tree problem

This page was built for publication: Algorithms and Computation