Sciweavers

    COMPGEOM
    1998
    ACM
    114views Discrete Geometry» more  COMPGEOM 1998»
    Design and Analysis of Planar Shape Deformation
    14 years 3 months ago
    Design and Analysis of Planar Shape Deformation
    Download  www.cs.duke.edu
    Shape deformation refers to the continuous change of one geometric object to another. We develop a software tool for planning, analyzing, and visualizing deformations between two ...
    Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-...
    claim paper
    Read More »
    COMPGEOM
    1998
    ACM
    97views Discrete Geometry» more  COMPGEOM 1998»
    Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry
    14 years 3 months ago
    Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry
    Download  hal.inria.fr
    We discuss floating-point filters as a means of restricting the precision needed for arithmetic operations while still computing the exact result. We show that interval techniques...
    Hervé Brönnimann, Christoph Burnikel, ...
    claim paper
    Read More »
    COMPGEOM
    1998
    ACM
    97views Discrete Geometry» more  COMPGEOM 1998»
    Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
    14 years 3 months ago
    Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
    Download  www.ics.uci.edu
    Gill Barequet, Michael T. Goodrich
    claim paper
    Read More »
    COMPGEOM
    1990
    ACM
    59views Discrete Geometry» more  COMPGEOM 1990»
    Linear Programming and Convex Hulls Made Easy
    14 years 3 months ago
    Linear Programming and Convex Hulls Made Easy
    Download  www.eecs.berkeley.edu
    Raimund Seidel
    claim paper
    Read More »
    COMPGEOM
    1990
    ACM
    94views Discrete Geometry» more  COMPGEOM 1990»
    Minimum-Link Paths Among Obstacles in the Plane
    14 years 3 months ago
    Minimum-Link Paths Among Obstacles in the Plane
    Download  www.inf.fu-berlin.de
    Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
    Joseph S. B. Mitchell, Günter Rote, Gerhard J...
    claim paper
    Read More »
    COMPGEOM
    1990
    ACM
    120views Discrete Geometry» more  COMPGEOM 1990»
    Finding Compact Coordinate Representations for Polygons and Polyhedra
    14 years 3 months ago
    Finding Compact Coordinate Representations for Polygons and Polyhedra
    Download  www.loria.fr
    Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
    Victor Milenkovic, Lee R. Nackman
    claim paper
    Read More »
    COMPGEOM
    1990
    ACM
    71views Discrete Geometry» more  COMPGEOM 1990»
    On Solving Geometric Optimization Problems Using Shortest Paths
    14 years 3 months ago
    On Solving Geometric Optimization Problems Using Shortest Paths
    Download  www.cs.tufts.edu
    Elefterios A. Melissaratos, Diane L. Souvaine
    claim paper
    Read More »
    COMPGEOM
    1989
    ACM
    125views Discrete Geometry» more  COMPGEOM 1989»
    Epsilon Geometry: Building Robust Algorithms from Imprecise Computations
    14 years 3 months ago
    Epsilon Geometry: Building Robust Algorithms from Imprecise Computations
    Download  www.loria.fr
    David Salesin, Jorge Stolfi, Leonidas J. Guibas
    claim paper
    Read More »
    COMPGEOM
    1989
    ACM
    94views Discrete Geometry» more  COMPGEOM 1989»
    Computing the Irreducible Real Factors and Components of an Algebraic Curve
    14 years 3 months ago
    Computing the Irreducible Real Factors and Components of an Algebraic Curve
    Download  www4.ncsu.edu
    We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
    Erich Kaltofen
    claim paper
    Read More »
    COMPGEOM
    1989
    ACM
    85views Discrete Geometry» more  COMPGEOM 1989»
    Computing Partial Sums in Multidimensional Arrays
    14 years 3 months ago
    Computing Partial Sums in Multidimensional Arrays
    Download  www.cs.princeton.edu
    d Abstract) Bernard Chazelle Burton Rosenberg Department of Computer Science Princeton University
    Bernard Chazelle, Burton Rosenberg
    claim paper
    Read More »
    « first‹ previous…272829303132333435…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.