Sciweavers

    COMPGEOM
    1991
    ACM
    102views Discrete Geometry» more  COMPGEOM 1991»
    The Two Guards Problem
    13 years 8 months ago
    The Two Guards Problem
    Download  www.pi6.fernuni-hagen.de
    Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
    Christian Icking, Rolf Klein
    claim paper
    Read More »
    COMPGEOM
    1991
    ACM
    158views Discrete Geometry» more  COMPGEOM 1991»
    Polynomial-Size Nonobtuse Triangulation of Polygons
    13 years 8 months ago
    Polynomial-Size Nonobtuse Triangulation of Polygons
    Download  www.ics.uci.edu
    We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with...
    Marshall W. Bern, David Eppstein
    claim paper
    Read More »
    COMPGEOM
    1991
    ACM
    147views Discrete Geometry» more  COMPGEOM 1991»
    A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
    13 years 8 months ago
    A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
    Download  cgm.cs.mcgill.ca
    We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
    David Avis, Komei Fukuda
    claim paper
    Read More »
    COMPGEOM
    1991
    ACM
    107views Discrete Geometry» more  COMPGEOM 1991»
    Crossing Families
    13 years 8 months ago
    Crossing Families
    Download  www.cs.clemson.edu
    Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
    Boris Aronov, Paul Erdös, Wayne Goddard, Dani...
    claim paper
    Read More »
    COMPGEOM
    1991
    ACM
    111views Discrete Geometry» more  COMPGEOM 1991»
    Arrangements of Segments that Share Endpoints: Single Face Results
    13 years 8 months ago
    Arrangements of Segments that Share Endpoints: Single Face Results
    Download  acg.cs.tau.ac.il
    We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...
    Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph...
    claim paper
    Read More »
    COMPGEOM
    1991
    ACM
    104views Discrete Geometry» more  COMPGEOM 1991»
    Triangulation and CSG Representation of Polyhedra with Arbitrary Genus
    13 years 8 months ago
    Triangulation and CSG Representation of Polyhedra with Arbitrary Genus
    Download  www.jos.org.cn
    Tamal K. Dey
    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.