Sciweavers

    CCCG
    2007
    75views Computational Geometry» more  CCCG 2007»
    On Rolling Cube Puzzles
    14 years 28 days ago
    On Rolling Cube Puzzles
    Download  cccg.ca
    We analyze the computational complexity of various rolling cube puzzles.
    Kevin Buchin, Maike Buchin, Erik D. Demaine, Marti...
    claim paper
    Read More »
    CCCG
    2007
    111views Computational Geometry» more  CCCG 2007»
    A Lower Bound on the Area of a 3-Coloured Disc Packing
    14 years 28 days ago
    A Lower Bound on the Area of a 3-Coloured Disc Packing
    Download  www.cs.uwaterloo.ca
    Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
    Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...
    claim paper
    Read More »
    CCCG
    2007
    92views Computational Geometry» more  CCCG 2007»
    Triangulations Loosing Bundles and Weight
    14 years 28 days ago
    Triangulations Loosing Bundles and Weight
    Download  cccg.ca
    We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
    Cem Boyaci, Hale Erten, Alper Üngör
    claim paper
    Read More »
    CCCG
    2007
    111views Computational Geometry» more  CCCG 2007»
    Optimal Point Set Partitioning using Rigid Motion Star Placement
    14 years 28 days ago
    Optimal Point Set Partitioning using Rigid Motion Star Placement
    Download  cccg.ca
    We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
    Prosenjit Bose, Jason Morrison
    claim paper
    Read More »
    CCCG
    2007
    104views Computational Geometry» more  CCCG 2007»
    Unfolding Polyhedra via Cut-Tree Truncation
    14 years 28 days ago
    Unfolding Polyhedra via Cut-Tree Truncation
    Download  maven.smith.edu
    We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, always unfold without overlap. The class includes the “domes,” providing a sim...
    Alex Benton, Joseph O'Rourke
    claim paper
    Read More »
    CCCG
    2007
    130views Computational Geometry» more  CCCG 2007»
    Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
    14 years 28 days ago
    Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
    Download  people.csail.mit.edu
    The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
    Nadia Benbernou, Erik D. Demaine, Martin L. Demain...
    claim paper
    Read More »
    CCCG
    2007
    82views Computational Geometry» more  CCCG 2007»
    Terrain Representation using Right-Triangulated Irregular Networks
    14 years 28 days ago
    Terrain Representation using Right-Triangulated Irregular Networks
    Download  cccg.ca
    A quadtree-based triangulation, sometimes called an RTIN, is a common hierarchical representation of terrain for 3D visualization. In this paper we focus on the memory/error bound...
    Suddha Basu, Jack Snoeyink
    claim paper
    Read More »
    CCCG
    2007
    95views Computational Geometry» more  CCCG 2007»
    Optimal Schedules for 2-guard Room Search
    14 years 28 days ago
    Optimal Schedules for 2-guard Room Search
    Download  www.cs.uwaterloo.ca
    We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
    Stephen Bahun, Anna Lubiw
    claim paper
    Read More »
    CCCG
    2007
    118views Computational Geometry» more  CCCG 2007»
    Homothetic Triangle Contact Representations of Planar Graphs
    14 years 28 days ago
    Homothetic Triangle Contact Representations of Planar Graphs
    Download  cccg.ca
    In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
    Melanie Badent, Carla Binucci, Emilio Di Giacomo, ...
    claim paper
    Read More »
    CCCG
    2007
    138views Computational Geometry» more  CCCG 2007»
    Approximations of Geodesic Distances for Incomplete Triangular Manifolds
    14 years 28 days ago
    Approximations of Geodesic Distances for Incomplete Triangular Manifolds
    Download  cg.scs.carleton.ca
    We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
    Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stef...
    claim paper
    Read More »
    « first‹ previous…161718192021222324next ›last »
    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.