Sciweavers

    IJCGA
    1998
    74views more  IJCGA 1998»
    Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
    13 years 4 months ago
    Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
    Download  acg.cs.tau.ac.il
    We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
    Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...
    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.