Sciweavers

    COMGEO
    2006
    ACM
    74views Applied Computing» more  COMGEO 2006»
    The minimum Manhattan network problem: Approximations and exact solutions
    13 years 8 months ago
    The minimum Manhattan network problem: Approximations and exact solutions
    Download  www1.informatik.uni-wuerzburg.de
    Marc Benkert, Alexander Wolff, Florian Widmann, Ta...
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    182views Applied Computing» more  COMGEO 2006»
    Computing homotopic shortest paths efficiently
    13 years 8 months ago
    Computing homotopic shortest paths efficiently
    Download  dimacs.rutgers.edu
    Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
    Alon Efrat, Stephen G. Kobourov, Anna Lubiw
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    72views Applied Computing» more  COMGEO 2006»
    Special Issue on Robust Geometric Algorithms and their Implementations
    13 years 8 months ago
    Special Issue on Robust Geometric Algorithms and their Implementations
    Download  www.cs.nyu.edu
    Chee-Keng Yap, Sylvain Pion
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    96views Applied Computing» more  COMGEO 2006»
    A result about the density of iterated line intersections in the plane
    13 years 8 months ago
    A result about the density of iterated line intersections in the plane
    Download  www.msri.org
    Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
    Christopher J. Hillar, Darren L. Rhea
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    114views Applied Computing» more  COMGEO 2006»
    A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
    13 years 8 months ago
    A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
    Download  www.mathematik.uni-ulm.de
    An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
    Simone Klenk, Volker Schmidt, Evgueni Spodarev
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    86views Applied Computing» more  COMGEO 2006»
    The predicates of the Apollonius diagram: Algorithmic analysis and implementation
    13 years 8 months ago
    The predicates of the Apollonius diagram: Algorithmic analysis and implementation
    Download  www.tem.uoc.gr
    Ioannis Z. Emiris, Menelaos I. Karavelas
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    90views Applied Computing» more  COMGEO 2006»
    Exact, efficient, and complete arrangement computation for cubic curves
    13 years 8 months ago
    Exact, efficient, and complete arrangement computation for cubic curves
    Download  www.staff.uni-mainz.de
    Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    104views Applied Computing» more  COMGEO 2006»
    Preferred directions for resolving the non-uniqueness of Delaunay triangulations
    13 years 8 months ago
    Preferred directions for resolving the non-uniqueness of Delaunay triangulations
    Download  heim.ifi.uio.no
    : This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
    Christopher Dyken, Michael S. Floater
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    74views Applied Computing» more  COMGEO 2006»
    Online searching with an autonomous robot
    13 years 8 months ago
    Online searching with an autonomous robot
    Download  kos.informatik.uni-osnabrueck.de
    Sándor P. Fekete, Rolf Klein, Andreas N&uum...
    claim paper
    Read More »
    COMGEO
    2006
    ACM
    78views Applied Computing» more  COMGEO 2006»
    Inner and outer rounding of Boolean operations on lattice polygonal regions
    13 years 8 months ago
    Inner and outer rounding of Boolean operations on lattice polygonal regions
    Download  hal.inria.fr
    Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
    Olivier Devillers, Philippe Guigue
    claim paper
    Read More »
    « first‹ previous…162163164165166167168169170…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.