Sciweavers

    CCCG
    2009
    120views Computational Geometry» more  CCCG 2009»
    Approximating Maximum Flow in Polygonal Domains using Spanners
    13 years 10 months ago
    Approximating Maximum Flow in Polygonal Domains using Spanners
    Download  cccg.ca
    We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
    Joondong Kim, Joseph S. B. Mitchell, Jingyu Zou
    claim paper
    Read More »
    CCCG
    2009
    72views Computational Geometry» more  CCCG 2009»
    Minimizing Slope Change in Imprecise 1.5D terrains
    13 years 10 months ago
    Minimizing Slope Change in Imprecise 1.5D terrains
    Download  www-ma2.upc.edu
    Chris Gray, Maarten Löffler, Rodrigo I. Silve...
    claim paper
    Read More »
    CCCG
    2009
    136views Computational Geometry» more  CCCG 2009»
    A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods
    13 years 10 months ago
    A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods
    Download  www.ece.uvic.ca
    Michael D. Adams
    claim paper
    Read More »
    CCCG
    2009
    83views Computational Geometry» more  CCCG 2009»
    Generalized jewels and the point placement problem
    13 years 10 months ago
    Generalized jewels and the point placement problem
    Download  cccg.ca
    The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
    Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sark...
    claim paper
    Read More »
    CCCG
    2009
    111views Computational Geometry» more  CCCG 2009»
    Nucleation-free 3D rigidity
    13 years 10 months ago
    Nucleation-free 3D rigidity
    Download  cccg.ca
    All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
    Jialong Cheng, Meera Sitharam, Ileana Streinu
    claim paper
    Read More »
    CCCG
    2009
    125views Computational Geometry» more  CCCG 2009»
    The Centervertex Theorem for Wedge Depth
    13 years 10 months ago
    The Centervertex Theorem for Wedge Depth
    Download  www.cs.cmu.edu
    There are many depth measures on point sets that yield centerpoint theorems. These theorems guarantee the existence of points of a specified depth, a kind of geometric median. How...
    Gary L. Miller, Todd Phillips, Donald Sheehy
    claim paper
    Read More »
    CCCG
    2009
    84views Computational Geometry» more  CCCG 2009»
    An Inequality on the Edge Lengths of Triangular Meshes
    13 years 10 months ago
    An Inequality on the Edge Lengths of Triangular Meshes
    Download  digital.cs.usu.edu
    Minghui Jiang
    claim paper
    Read More »
    CCCG
    2009
    109views Computational Geometry» more  CCCG 2009»
    Defining and computing accessibility radius
    13 years 10 months ago
    Defining and computing accessibility radius
    Download  cccg.ca
    In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
    Vishal Verma, Jack Snoeyink
    claim paper
    Read More »
    CCCG
    2009
    172views Computational Geometry» more  CCCG 2009»
    On the Dilation of Delaunay Triangulations of Points in Convex Position
    13 years 10 months ago
    On the Dilation of Delaunay Triangulations of Points in Convex Position
    Download  cccg.ca
    Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
    Shiliang Cui, Iyad A. Kanj, Ge Xia
    claim paper
    Read More »
    CCCG
    2009
    128views Computational Geometry» more  CCCG 2009»
    Bold Graph Drawings
    13 years 10 months ago
    Bold Graph Drawings
    Download  cccg.ca
    When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...
    Marc J. van Kreveld
    claim paper
    Read More »
    « first‹ previous123456789…next ›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.