Optimal parallel algorithms for transitive closure and point location in planar structures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Covering orthogonal polygons with star polygons: the perfect graph approach
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Path planning in 0/1/ weighted regions with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Triangulating a non-convex polytype
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Minimum K-partitioning of rectilinear polygons
Journal of Symbolic Computation
Towards image realism with interactive update rates in complex virtual building environments
I3D '90 Proceedings of the 1990 symposium on Interactive 3D graphics
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Enumeration and visibility problems in integer lattices (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Visibility preprocessing for interactive walkthroughs
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
ACM SIGACT News
Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing the antipenumbra of an area light source
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computational geometry column 18
ACM SIGACT News
An optimal algorithm for the two-guard problem
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the completeness and conversion of ray representations of arbitrary solids
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Stabbing triangulations by lines in 3D
Proceedings of the eleventh annual symposium on Computational geometry
Strategies for polyhedral surface decomposition: an experimental study
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the eleventh annual symposium on Computational geometry
Randomized query processing in robot path planning
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Computing Occlusion-Free Viewpoints
IEEE Transactions on Pattern Analysis and Machine Intelligence
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
Optimal floodlight illumination of stages
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for Petersen's matching theorem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal binary space partitions for orthogonal objects
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Algorthmic pradigms: examples in computational geometry II
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Computational geometry column 40
ACM SIGACT News
An efficient algorithm for finding the CSG representation of a simple polygon
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
A randomized art-gallery algorithm for sensor placement
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Efficient and small representation of line arrangements with applications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Finding the shortest boundary guard of a simple polygon
Theoretical Computer Science
A necessary condition for a graph to be the visibility graph of simple polygon
Theoretical Computer Science
Approximation algorithms for terrain guarding
Information Processing Letters
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
Orthogonal polygon reconstruction from stabbing information
Computational Geometry: Theory and Applications
User-centric viewpoint computation for haptic exploration and manipulation
Proceedings of the conference on Visualization '01
Discrete Mathematics - Kleitman and combinatorics: a celebration
On Compatible Star Decompositions of Simple Polygons
IEEE Transactions on Visualization and Computer Graphics
Accessibility Analysis Using Computer Graphics Hardware
IEEE Transactions on Visualization and Computer Graphics
Shape Blending Using the Star-Skeleton Representation
IEEE Computer Graphics and Applications
Superfaces: Polygonal Mesh Simplification with Bounded Error
IEEE Computer Graphics and Applications
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
An O(n log n) algorithm for the zoo-keeper's problem
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
On local transformation of polygons with visibility properties
Theoretical Computer Science
An O(log log n) time algorithm to compute the kernel of a polygon
Nordic Journal of Computing
Illuminating Polygons with Vertex pi-Floodlights
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Exploring an Unknown Polygonal Environment with Bounded Visibility
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Multiply Guarded Guards in Orthogonal Art Galleries
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Partitioning Colored Point Sets into Monochromatic Parts
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Optimal Algorithms for Two-Guard Walkability of Simple Polygons
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Placing Artificial Visual Landmarks in a Mobile Robot Workspace
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
Illuminating Both Sides of Line Segments
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Inapproximability Results for Guarding Polygons without Holes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
How Many People Can Hide in a Terrain?
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Open Problems in Computational Geometry
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Parallel Geometric Algorithms in Coarse-Grain Network Models
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On Local Transformation of Polygons with Visibility Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
On the Planar Two-Watchtower Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Performance of a Distributed Robotic System Using Shared Communication Channels
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
On Polar Visibility Representations of Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
Guarding disjoint triangles and claws in the plane
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Automatic Camera Placement for Image-Based Modeling
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Illumination of polygons by 45°-floodlights
Discrete Mathematics
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Computational Geometry: Theory and Applications
Art gallery theorems for guarded guards
Computational Geometry: Theory and Applications
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
VC-Dimension of Exterior Visibility
IEEE Transactions on Pattern Analysis and Machine Intelligence
On finding a guard that sees most and a shop that sells most
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of finding small triangulations of convex 3-polytopes
Journal of Algorithms - Special issue: SODA 2000
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Searching a polygonal region by a group of stationary k-searchers
Information Processing Letters
Uncertainty-aware and coverage-oriented deployment for sensor networks
Journal of Parallel and Distributed Computing
A constant-factor approximation algorithm for optimal terrain guarding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Visibility-based Pursuit-evasion with Limited Field of View
International Journal of Robotics Research
Online searching with an autonomous robot
Computational Geometry: Theory and Applications
A note on rectilinear and polar visibility graphs
Discrete Applied Mathematics
Orthogonal art galleries with interior walls
Discrete Applied Mathematics
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
Computer Vision and Image Understanding - Special issue on omnidirectional vision and camera networks
On the optimal placement of multiple visual sensors
Proceedings of the 4th ACM international workshop on Video surveillance and sensor networks
Segmenting object space by geometric reference structures
ACM Transactions on Sensor Networks (TOSN)
Guarding galleries and terrains
Information Processing Letters
Cooperative mobile guards in grids
Computational Geometry: Theory and Applications
Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms
Mutually visible agents in a discrete environment
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots
International Journal of Robotics Research
Deploying sensors for maximum coverage in sensor networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Reconfiguration methods for mobile sensor networks
ACM Transactions on Sensor Networks (TOSN)
Maximizing the guarded boundary of an Art Gallery is APX-complete
Computational Geometry: Theory and Applications
Encompassing colored planar straight line graphs
Computational Geometry: Theory and Applications
Optimal Camera Placement for Automated Surveillance Tasks
Journal of Intelligent and Robotic Systems
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
International Journal of Computer Vision
On guarding the vertices of rectilinear domains
Computational Geometry: Theory and Applications
All triangulations are reachable via sequences of edge-flips: an elementary proof
Computer Aided Geometric Design
Radial drawings of graphs: Geometric constraints and trade-offs
Journal of Discrete Algorithms
Computational Geometry: Theory and Applications
Sensor coverage in wireless ad hoc sensor networks
International Journal of Sensor Networks
Connectivity aware topology control in ad hoc networks using mobile routers
EHAC'05 Proceedings of the 4th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Guarding curvilinear art galleries with edge or mobile guards
Proceedings of the 2008 ACM symposium on Solid and physical modeling
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
Journal of Discrete Algorithms
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
An occlusion metric for selecting robust camera configurations
Machine Vision and Applications
A nearly optimal sensor placement algorithm for boundary coverage
Pattern Recognition
Self-orienting wireless multimedia sensor networks for occlusion-free viewpoints
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
On Some City Guarding Problems
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Covering a line segment with variable radius discs
Computers and Operations Research
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
K-vertex guarding simple polygons
Computational Geometry: Theory and Applications
Guarding curvilinear art galleries with vertex or point guards
Computational Geometry: Theory and Applications
Compatible geometric matchings
Computational Geometry: Theory and Applications
Point-set embeddings of trees with given partial drawings
Computational Geometry: Theory and Applications
Polychromatic 4-coloring of guillotine subdivisions
Information Processing Letters
Covering of problem in wireless sensor networks
TELE-INFO'09 Proceedings of the 8th Wseas international conference on Telecommunications and informatics
A new lower bound for evaluating the performances of sensor location algorithms
Pattern Recognition Letters
Floodlight illumination of infinite wedges
Computational Geometry: Theory and Applications
Recognition and reconstruction of visibility graphs using a genetic algorithm
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Task allocation via self-organizing swarm coalitions in distributed mobile sensor network
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Polygon exploration with time-discrete vision
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
New Results on Visibility in Simple Polygons
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
ε-Net Approach to Sensor k-Coverage
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Multi-robot exploration of an unknown environment, efficiently reducing the odometry error
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Approximating maximum edge 2-coloring in simple graphs via local improvement
Theoretical Computer Science
Optimal movement of mobile sensors for barrier coverage of a planar region
Theoretical Computer Science
Online searching with an autonomous robot
Computational Geometry: Theory and Applications
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Going off-road: transversal complexity in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Selection and orientation of directional sensors for coverage maximization
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Minimum Covering with Travel Cost
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Assigning cameras to subjects in video surveillance systems
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Note: A note on rectilinear and polar visibility graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Camera handoff and placement for automated tracking systems with multiple omnidirectional cameras
Computer Vision and Image Understanding
Issues and solutions in surveillance camera placement
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Can you see me now? sensor positioning for automated and persistent surveillance
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An electrostatic field- based coverage-enhancing algorithm for wireless multimedia sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
An art gallery-based approach: roadmap construction and path planning in global environments
International Journal of Robotics and Automation
Ɛ-net approach to sensor k-coverage
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
Visual reply to map-related queries
Journal of Visual Languages and Computing
maximizing the guarded boundary of an art gallery is APX-complete
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Connected guards in orthogonal art galleries
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Coverage, exploration, and deployment by a mobile robot and communication network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Sensor deployment for failure diagnosis in networked aerial robots: a satisfiability-based approach
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Energy efficient intrusion detection in camera sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Grasping Non-stretchable Cloth Polygons
International Journal of Robotics Research
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A coloring algorithm for finding connected guards in art galleries
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Point-set embedding of trees with edge constraints
GD'07 Proceedings of the 15th international conference on Graph drawing
Parallel algorithm to find minimum vertex guard set in a triangulated irregular network
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Guarding exterior region of a simple polygon
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Towards self-organising smart camera systems
ARCS'08 Proceedings of the 21st international conference on Architecture of computing systems
Computing multiple watchman routes
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Planar visibility: testing and counting
Proceedings of the twenty-sixth annual symposium on Computational geometry
Dominating sets of agents in visibility graphs: distributed algorithms for art gallery problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Computational Geometry: Theory and Applications
Approximating maximum edge 2-coloring in simple graphs
Discrete Applied Mathematics
Detection of spatial events in CommonSens
Proceedings of the 2nd ACM international workshop on Events in multimedia
Approximating maximum edge 2-coloring in simple graphs
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Algorithms and theory of computation handbook
Experimental study on approximation algorithms for guarding sets of line segments
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
Coverage with k-transmitters in the presence of obstacles
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Guarding a set of line segments in the plane
Theoretical Computer Science
Camera network coverage improving by particle swarm optimization
Journal on Image and Video Processing - Special issue on advanced video-based surveillance
Exploration strategies for a robot with a continously rotating 3D scanner
SIMPAR'10 Proceedings of the Second international conference on Simulation, modeling, and programming for autonomous robots
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
An efficient strategy for fast object search considering the robot's perceptual limitations
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Discrete Applied Mathematics
Optimal sensor placement with signal propagation effects and inhomogeneous coverage preferences
International Journal of Sensor Networks
Visibility-based conformal cooling channel generation for rapid tooling
Computer-Aided Design
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
A new upper bound for the VC-dimension of visibility regions
Proceedings of the twenty-seventh annual symposium on Computational geometry
Proceedings of the twenty-seventh annual symposium on Computational geometry
Complexity and approximability issues in combinatorial image analysis
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Beyond triangulation: covering polygons with triangles
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Exploring and triangulating a region by a swarm of robots
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Sensor placement tool for rapid development of video sensor layouts
Proceedings of the 2011 Symposium on Simulation for Architecture and Urban Design
Computational Geometry: Theory and Applications
Generalized multi-sensor planning
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Weakly cooperative guards in grids
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
On guarding rectilinear domains
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
How to place efficiently guards and paintings in an art gallery
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Optimal positioning of sensors in 3d
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Approximate guarding of monotone and rectilinear polygons
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Deployment issues in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Optimal guard placement problem under l-visibility
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
An efficient algorithm for mobile guarded guards in simple grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Fault tolerant guarding of grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Review: A survey on coverage and connectivity issues in wireless sensor networks
Journal of Network and Computer Applications
Generating and updating textures for a large-scale environment
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Guarding art galleries by guarding witnesses
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Computational geometry column 52
ACM SIGACT News
Digital stars and visibility of digital objects
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Watchman tours for polygons with holes
Computational Geometry: Theory and Applications
Approximation algorithms for a geometric set cover problem
Discrete Applied Mathematics
Characterizing and covering some subclasses of orthogonal polygons
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Approximation algorithms for art gallery problems in polygons and terrains
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Roadmap-Based level clearing of buildings
MIG'11 Proceedings of the 4th international conference on Motion in Games
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field
Journal of Discrete Algorithms
Computing accumulation density of particles on a line with parabolic trajectories
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Computing a maxian point of a simple rectilinear polygon
Operations Research Letters
Minimum covering with travel cost
Journal of Combinatorial Optimization
Normal art galleries: Wall in - all in
Computational Geometry: Theory and Applications
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
Information Processing Letters
Uninterrupted coverage of a planar region with rotating directional antennae
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Art galleries, k-modems, and k-convexity
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Watchman routes for lines and segments
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Multi-image based photon tracing for interactive global illumination of dynamic scenes
EGSR'10 Proceedings of the 21st Eurographics conference on Rendering
Shader lamps: animating real objects with image-based illumination
EGWR'01 Proceedings of the 12th Eurographics conference on Rendering
A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Computing best coverage path in the presence of obstacles in a sensor field
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Computer-Aided Design
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Genetic algorithm and pure random search for exosensor distribution optimisation
International Journal of Bio-Inspired Computation
Modeling Coverage in Camera Networks: A Survey
International Journal of Computer Vision
Coverage with k-transmitters in the presence of obstacles
Journal of Combinatorial Optimization
Multi-robot repeated area coverage
Autonomous Robots
Effect of beacon orientation on beacon placement strategies in the ultrasonic positioning system
Robotics and Autonomous Systems
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
Discrete Applied Mathematics
Optimal patrolling of fragmented boundaries
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Sweeping a terrain by collaborative aerial vehicles
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Computing highly occluded paths on a terrain
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Three-dimensional coverage planning for an underwater inspection robot
International Journal of Robotics Research
Guarding thin orthogonal polygons is hard
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
A new upper bound for the VC-dimension of visibility regions
Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Triangulating and guarding realistic polygons
Computational Geometry: Theory and Applications
Draining a polygon-or-rolling a ball out of a polygon
Computational Geometry: Theory and Applications
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
Special Section on CAD/Graphics 2013: Geometric multi-covering
Computers and Graphics
| Hi-index | 0.01 |