Fast and Scalable Domino Portrait Generation

DOI10.1007/978-3-540-68155-7_7MaRDI QIDQ5387620zbMATH OpenOpenAlexFDO

Authors Hadrien Cambazard, John Horan, Eoin O'Mahony, Barry O'Sullivan

Publication date 27 May 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68155-7_7

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Machine vision and scene understanding (68T45) Computing methodologies for image processing (68U10)

Recommendations

• Domino portrait generation: a fast and scalable approach
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• An O(n n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
• Reconstruction of domino tilings -- combinatorial and probabilistic questions
• The reconstruction of a subclass of domino tilings from two projections

Cites work

• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• scientific article; zbMATH DE number 1292653 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.

Cited in

(2)

• Domino portrait generation: a fast and scalable approach
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Fast and Scalable Domino Portrait Generation

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