Sciweavers

    COMPGEOM
    1993
    ACM
    122views Discrete Geometry» more  COMPGEOM 1993»
    A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
    13 years 11 months ago
    A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
    Download  www.pi6.fernuni-hagen.de
    For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
    Rolf Klein, Andrzej Lingas
    claim paper
    Read More »
    COMPGEOM
    1993
    ACM
    104views Discrete Geometry» more  COMPGEOM 1993»
    Convex Distance Functions in 3-Space are Different
    13 years 11 months ago
    Convex Distance Functions in 3-Space are Different
    Download  www.pi6.fernuni-hagen.de
    Christian Icking, Rolf Klein, Ngoc-Minh Lê, ...
    claim paper
    Read More »
    COMPGEOM
    1993
    ACM
    107views Discrete Geometry» more  COMPGEOM 1993»
    Combinatorial Complexity of Translating a Box in Polyhedral 3-Space
    13 years 11 months ago
    Combinatorial Complexity of Translating a Box in Polyhedral 3-Space
    Download  acg.cs.tau.ac.il
    Dan Halperin, Chee-Keng Yap
    claim paper
    Read More »
    COMPGEOM
    1993
    ACM
    97views Discrete Geometry» more  COMPGEOM 1993»
    An Incremental Algorithm for Betti Numbers of Simplicial Complexes
    13 years 11 months ago
    An Incremental Algorithm for Betti Numbers of Simplicial Complexes
    Download  math.stanford.edu
    Cecil Jose A. Delfinado, Herbert Edelsbrunner
    claim paper
    Read More »
    COMPGEOM
    1993
    ACM
    153views Discrete Geometry» more  COMPGEOM 1993»
    Approximating Center Points with Iterated Radon Points
    13 years 11 months ago
    Approximating Center Points with Iterated Radon Points
    Download  www.almaden.ibm.com
    We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
    Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
    claim paper
    Read More »
    COMPGEOM
    1993
    ACM
    120views Discrete Geometry» more  COMPGEOM 1993»
    Worst-Case Bounds for Subadditive Geometric Graphs
    13 years 11 months ago
    Worst-Case Bounds for Subadditive Geometric Graphs
    Download  www.ics.uci.edu
    We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
    Marshall W. Bern, David Eppstein
    claim paper
    Read More »
    COMPGEOM
    1993
    ACM
    111views Discrete Geometry» more  COMPGEOM 1993»
    Can Visibility Graphs be Represented Compactly?
    13 years 11 months ago
    Can Visibility Graphs be Represented Compactly?
    Download  www.math.tau.ac.il
    Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhas...
    claim paper
    Read More »
    COMPGEOM
    1993
    ACM
    84views Discrete Geometry» more  COMPGEOM 1993»
    Helly Theorems and Generalized Linear Programming
    13 years 11 months ago
    Helly Theorems and Generalized Linear Programming
    Download  www.cs.ucdavis.edu
    Nina Amenta
    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.