Sciweavers

    82
    Voted
    CCCG
    2003
    83views Computational Geometry» more  CCCG 2003»
    Hinged Dissection of Polygons is Hard
    15 years 17 days ago
    Hinged Dissection of Polygons is Hard
    Download  www.dartmouth.edu
    We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
    Robert A. Hearn, Erik D. Demaine, Greg N. Frederic...
    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-2025, USA.