Sciweavers

    2601 search results - page 4 / 521
    » A Point in Many Triangles
    Sort
    View
    COMPGEOM
    1991
    ACM
    158views Discrete Geometry» more  COMPGEOM 1991»
    Polynomial-Size Nonobtuse Triangulation of Polygons
    13 years 11 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 »
    IPCO
    2007
    114views Optimization» more  IPCO 2007»
    Distinct Triangle Areas in a Planar Point Set
    13 years 9 months ago
    Distinct Triangle Areas in a Planar Point Set
    Download  math.mit.edu
    Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
    Adrian Dumitrescu, Csaba D. Tóth
    claim paper
    Read More »
    CCCG
    2007
    103views Computational Geometry» more  CCCG 2007»
    On the Number of Empty Pseudo-Triangles in Point Sets
    13 years 9 months ago
    On the Number of Empty Pseudo-Triangles in Point Sets
    Download  www.win.tue.nl
    We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
    Marc J. van Kreveld, Bettina Speckmann
    claim paper
    Read More »
    CCCG
    2009
    112views Computational Geometry» more  CCCG 2009»
    Optimal Empty Pseudo-Triangles in a Point Set
    13 years 8 months ago
    Optimal Empty Pseudo-Triangles in a Point Set
    Download  www.postech.ac.kr
    Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
    Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher
    claim paper
    Read More »
    ANTS
    2006
    Springer
    123views Algorithms» more  ANTS 2006»
    Computing CM Points on Shimura Curves Arising from Cocompact Arithmetic Triangle Groups
    13 years 11 months ago
    Computing CM Points on Shimura Curves Arising from Cocompact Arithmetic Triangle Groups
    Download  www.cems.uvm.edu
    John Voight
    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.