Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
International Journal of Robotics Research
Relative Convex Hulls in Semi-dynamic Subdivisions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Algorithms for Computing Diffuse Reflection Paths in Polygons
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Shooting permanent rays among disjoint polygons in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
Grasping Non-stretchable Cloth Polygons
International Journal of Robotics Research
Optimal placement of UV-based communications relay nodes
Journal of Global Optimization
Graphs with large obstacle numbers
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A polygon is determined by its angles
Computational Geometry: Theory and Applications
Disjoint compatible geometric matchings
Proceedings of the twenty-seventh annual symposium on Computational geometry
Visibility testing and counting
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Reconstructing a simple polygon from its angles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Reconstructing visibility graphs with simple robots
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Approximation algorithms for art gallery problems in polygons and terrains
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
How simple robots benefit from looking back
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Simple characterization of LR-visibility polygons
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Sensing and Filtering: A Fresh Perspective Based on Preimages and Information Spaces
Foundations and Trends in Robotics
Computing the visibility polygon using few variables
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Reconstructing visibility graphs with simple robots
Theoretical Computer Science
Survey: Online algorithms for searching and exploration in the plane
Computer Science Review
Minimization of the maximum distance between the two guards patrolling a polygonal region
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Perspective: Simple agents learn to find their way: An introduction on mapping polygons
Discrete Applied Mathematics
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
Discrete Applied Mathematics
Weak visibility polygons of NURBS curves inside simple polygons
Journal of Computational and Applied Mathematics
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)
Computational Geometry: Theory and Applications
Characterizing and recognizing LR-visibility polygons
Discrete Applied Mathematics
| Hi-index | 0.00 |