Sciweavers

    ISAAC
    2005
    Springer
    86views Algorithms» more  ISAAC 2005»
    On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
    13 years 10 months ago
    On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
    Download  www2.cs.uregina.ca
    We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
    Chris Worman, Boting Yang
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.