Sciweavers

    16 search results - page 2 / 4
    » comgeo 2007
    Sort
    View
    COMGEO
    2007
    ACM
    85views Applied Computing» more  COMGEO 2007»
    Learning smooth shapes by probing
    13 years 5 months ago
    Learning smooth shapes by probing
    Download  graphics.stanford.edu
    We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
    Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
    claim paper
    Read More »
    COMGEO
    2007
    ACM
    97views Applied Computing» more  COMGEO 2007»
    Drawings of planar graphs with few slopes and segments
    13 years 5 months ago
    Drawings of planar graphs with few slopes and segments
    Download  www.ms.unimelb.edu.au
    We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
    Vida Dujmovic, David Eppstein, Matthew Suderman, D...
    claim paper
    Read More »
    COMGEO
    2007
    ACM
    133views Applied Computing» more  COMGEO 2007»
    Geometric dilation of closed planar curves: New lower bounds
    13 years 5 months ago
    Geometric dilation of closed planar curves: New lower bounds
    Download  web.informatik.uni-bonn.de
    Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
    Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...
    claim paper
    Read More »
    COMGEO
    2007
    ACM
    82views Applied Computing» more  COMGEO 2007»
    An intersection-sensitive algorithm for snap rounding
    13 years 5 months ago
    An intersection-sensitive algorithm for snap rounding
    Download  www.cs.tau.ac.il
    Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
    Mark de Berg, Dan Halperin, Mark H. Overmars
    claim paper
    Read More »
    COMGEO
    2007
    ACM
    89views Applied Computing» more  COMGEO 2007»
    On simultaneous planar graph embeddings
    13 years 5 months ago
    On simultaneous planar graph embeddings
    Download  www.cs.arizona.edu
    We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
    Peter Braß, Eowyn Cenek, Christian A. Duncan...
    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.