Sciweavers

    COMPGEOM
    2003
    ACM
    122views Discrete Geometry» more  COMPGEOM 2003»
    Finding a curve in a map
    13 years 11 months ago
    Finding a curve in a map
    Download  www.cs.utsa.edu
    Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
    Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    182views Discrete Geometry» more  COMPGEOM 2003»
    Polygon decomposition based on the straight line skeleton
    13 years 11 months ago
    Polygon decomposition based on the straight line skeleton
    Download  www.cs.uu.nl
    We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
    Mirela Tanase, Remco C. Veltkamp
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    106views Discrete Geometry» more  COMPGEOM 2003»
    Updating and constructing constrained delaunay and constrained regular triangulations by flips
    13 years 11 months ago
    Updating and constructing constrained delaunay and constrained regular triangulations by flips
    Download  www.cs.berkeley.edu
    I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
    Jonathan Richard Shewchuk
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    100views Discrete Geometry» more  COMPGEOM 2003»
    Constructive root bound for k-ary rational input numbers
    13 years 11 months ago
    Constructive root bound for k-ary rational input numbers
    Download  www.cs.nyu.edu
    Sylvain Pion, Chee-Keng Yap
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    107views Discrete Geometry» more  COMPGEOM 2003»
    A tight bound for the number of different directions in three dimensions
    13 years 11 months ago
    A tight bound for the number of different directions in three dimensions
    Download  www.math.technion.ac.il
    János Pach, Rom Pinchasi, Micha Sharir
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    146views Discrete Geometry» more  COMPGEOM 2003»
    Estimating surface normals in noisy point cloud data
    13 years 11 months ago
    Estimating surface normals in noisy point cloud data
    Download  graphics.stanford.edu
    In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
    Niloy J. Mitra, An Nguyen
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    119views Discrete Geometry» more  COMPGEOM 2003»
    New constructions of weak epsilon-nets
    13 years 11 months ago
    New constructions of weak epsilon-nets
    Download  www.inf.ethz.ch
    Jivri Matouaek
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    129views Discrete Geometry» more  COMPGEOM 2003»
    Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
    13 years 11 months ago
    Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
    Download  www.cs.berkeley.edu
    We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteed-quality meshes of domains in which lon...
    François Labelle, Jonathan Richard Shewchuk
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    94views Discrete Geometry» more  COMPGEOM 2003»
    Good NEWS: partitioning a simple polygon by compass directions
    13 years 11 months ago
    Good NEWS: partitioning a simple polygon by compass directions
    Download  www.geometrylab.de
    Marc J. van Kreveld, Iris Reinbacher
    claim paper
    Read More »
    COMPGEOM
    2003
    ACM
    100views Discrete Geometry» more  COMPGEOM 2003»
    Curve-sensitive cuttings
    13 years 11 months ago
    Curve-sensitive cuttings
    Download  graphics.stanford.edu
    We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
    Vladlen Koltun, Micha Sharir
    claim paper
    Read More »
    1234next ›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.