Finding the visibility graph of a simple polygon in time proportional to its size
SCG '87 Proceedings of the third annual symposium on Computational geometry
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An efficient algorithm for one-step planar complaint motion planning with uncertainty
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Shortest rectilinear paths among weighted obstacles
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Using focusing search algorithms and a strong heuristic to solve the findpath problem in robotics
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
The weighted region problem: finding shortest paths through a weighted planar subdivision
Journal of the ACM (JACM)
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Shortest paths in the plane with polygonal obstacles
Journal of the ACM (JACM)
Rectilinear geodesics in 3-space (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Monotonicity of rectilinear geodesics in d-space (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
On Computing the Upper Envelope of Segments in Parallel
IEEE Transactions on Parallel and Distributed Systems
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model
IEEE Transactions on Computers
A New Visibility Partition for Affine Pattern Matching
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
Computing the visibility graph of points within a polygon
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
An output sensitive algorithm for computing visibility graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory 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
Weak visibility of two objects in planar polygonal scenes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
An optimal hidden-surface algorithm and its parallelization
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
GD'05 Proceedings of the 13th international conference on Graph Drawing
Computing shortest paths amid pseudodisks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for art gallery problems in polygons and terrains
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Computing the visibility polygon of an island in a polygonal domain
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
Lower bounds for sorted geometric queries in the I/O model
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Computing shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Virtual Stretched String: An Optimal Path Planning Technique over Polygonal Obstacles
Proceedings of Conference on Advances In Robotics
Efficient wayfinding in complex environments: derivation of a continuous space shortest path
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Path planning with obstacle avoidance based on visibility binary tree algorithm
Robotics and Autonomous Systems
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Computational Geometry: Theory and Applications
Scalable visibility color map construction in spatial databases
Information Systems
| Hi-index | 0.00 |