Sciweavers

    98
    Voted
    COMGEO
    2007
    ACM
    82views Applied Computing» more  COMGEO 2007»
    An intersection-sensitive algorithm for snap rounding
    15 years 19 days 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
    154views Applied Computing» more  COMGEO 2007»
    Geometric spanners with applications in wireless networks
    15 years 19 days ago
    Geometric spanners with applications in wireless networks
    Download  cone.informatik.uni-freiburg.de
    In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
    Christian Schindelhauer, Klaus Volbert, Martin Zie...
    claim paper
    Read More »
    95
    Voted
    COMGEO
    2007
    ACM
    129views Applied Computing» more  COMGEO 2007»
    Advanced programming techniques applied to Cgal's arrangement package
    15 years 19 days ago
    Advanced programming techniques applied to Cgal's arrangement package
    Download  www.cs.tau.ac.il
    Arrangements of planar curves are fundamental structures in computational geometry. Recently, the arrangement package of Cgal, the Computational Geometry Algorithms Library, has b...
    Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin
    claim paper
    Read More »
    121
    Voted
    COMGEO
    2007
    ACM
    92views Applied Computing» more  COMGEO 2007»
    On incremental rendering of silhouette maps of a polyhedral scene
    15 years 19 days ago
    On incremental rendering of silhouette maps of a polyhedral scene
    Download  research.microsoft.com
    We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
    Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
    claim paper
    Read More »
    105
    Voted
    COMGEO
    2007
    ACM
    91views Applied Computing» more  COMGEO 2007»
    A package for exact kinetic data structures and sweepline algorithms
    15 years 19 days ago
    A package for exact kinetic data structures and sweepline algorithms
    Download  graphics.stanford.edu
    In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
    Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...
    claim paper
    Read More »
    128
    Voted
    COMGEO
    2007
    ACM
    98views Applied Computing» more  COMGEO 2007»
    Graph drawings with few slopes
    15 years 19 days ago
    Graph drawings with few slopes
    Download  www.ms.unimelb.edu.au
    The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
    Vida Dujmovic, Matthew Suderman, David R. Wood
    claim paper
    Read More »
    86
    Voted
    COMGEO
    2007
    ACM
    107views Applied Computing» more  COMGEO 2007»
    Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
    15 years 19 days ago
    Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
    Download  www.cs.unc.edu
    Deepak Bandyopadhyay, Jack Snoeyink
    claim paper
    Read More »
    91
    Voted
    COMGEO
    2007
    ACM
    97views Applied Computing» more  COMGEO 2007»
    Drawings of planar graphs with few slopes and segments
    15 years 19 days 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 »
    106
    Voted
    COMGEO
    2007
    ACM
    85views Applied Computing» more  COMGEO 2007»
    Learning smooth shapes by probing
    15 years 19 days 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 »
    87
    Voted
    COMGEO
    2007
    ACM
    129views Applied Computing» more  COMGEO 2007»
    Configurations with few crossings in topological graphs
    15 years 19 days ago
    Configurations with few crossings in topological graphs
    Download  i11www.iti.uni-karlsruhe.de
    Christian Knauer, Étienne Schramm, Andreas ...
    claim paper
    Read More »
    12next ›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-2025, USA.