Sciweavers

    107 search results - page 3 / 22
    » Approximation algorithms for art gallery problems in polygon...
    Sort
    View
    AAAI
    2007
    97views Intelligent Agents» more  AAAI 2007»
    Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
    13 years 8 months ago
    Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
    Download  www.cs.ucsb.edu
    We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
    Subhash Suri, Elias Vicari, Peter Widmayer
    claim paper
    Read More »
    ALGORITHMICA
    2010
    88views more  ALGORITHMICA 2010»
    Improved Bounds for Wireless Localization
    13 years 5 months ago
    Improved Bounds for Wireless Localization
    Download  www.is.titech.ac.jp
    We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
    Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
    claim paper
    Read More »
    IVC
    2000
    179views more  IVC 2000»
    A system to place observers on a polyhedral terrain in polynomial time
    13 years 5 months ago
    A system to place observers on a polyhedral terrain in polynomial time
    Download  vis-www.cs.umass.edu
    The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
    Maurício Marengoni, Bruce A. Draper, Allen ...
    claim paper
    Read More »
    ALGORITHMICA
    2005
    95views more  ALGORITHMICA 2005»
    Near-Linear Time Approximation Algorithms for Curve Simplification
    13 years 5 months ago
    Near-Linear Time Approximation Algorithms for Curve Simplification
    Download  biogeometry.duke.edu
    Abstract. We consider the problem of approximating a polygonal curve
    Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Must...
    claim paper
    Read More »
    JUCS
    2007
    137views more  JUCS 2007»
    An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
    13 years 5 months ago
    An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
    Download  www.jucs.org
    : An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
    Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu
    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.