Algorithms and Computation

DOI10.1007/B104582MaRDI QIDQ5712142zbMATH OpenOpenAlexFDO

Authors Peter Hui, Marcus Schaefer

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

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

Recommendations

• scientific article; zbMATH DE number 637475
• scientific article; zbMATH DE number 17098
• Point set pattern matching in \(d\)-dimensions
• scientific article; zbMATH DE number 1286752
• Pairs of paths and critical points
• On Pairwise Spanners
• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES

Cited in

(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

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