Structured visibility profiles with applications to problems in simple polygons (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An optimal parallel algorithm for the visibility of a simple polygon from a point
Journal of the ACM (JACM)
An upper bound for conforming Delaunay triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On Compatible Star Decompositions of Simple Polygons
IEEE Transactions on Visualization and Computer Graphics
Optimal Parallel Hypercube Algorithms for Polygon Problems
IEEE Transactions on Computers
On the Planar Two-Watchtower Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Efficient visibility queries in simple polygons
Computational Geometry: Theory and Applications
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
Query-point visibility constrained shortest paths in simple polygons
Theoretical Computer Science
Visiting a Polygon on the Optimal Way to a Query Point
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Discrete Applied Mathematics
A linear time algorithm to remove winding of a simple polygon
Computational Geometry: Theory and Applications
Experimental evaluation of an exact algorithm for the orthogonal art gallery problem
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Approximate guarding of monotone and rectilinear polygons
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Guarding art galleries by guarding witnesses
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Computing the visibility polygon using few variables
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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
Normal art galleries: Wall in - all in
Computational Geometry: Theory and Applications
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
Draining a polygon-or-rolling a ball out of a polygon
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |