Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Can visibility graphs be represented compactly?
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
Rectilinear geodesics in 3-space (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
The visibility complex made visibly simple: an introduction to 2D structures of visibility
Proceedings of the eleventh annual symposium on Computational geometry
Maintenance of the set of segments visible from a moving viewpoint in two dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Developing algorithms and software for geometric path planning problems
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
More practical bounded-skew clock routing
DAC '97 Proceedings of the 34th annual Design Automation Conference
Optimal Polygon Cover Problems and Applcations
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A New Visibility Partition for Affine Pattern Matching
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Information Processing Letters
Segment endpoint visibility graphs are Hamiltonian
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Computing the visibility graph of points within a polygon
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
The visibility--voronoi complex and its applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The visibility-Voronoi complex and its applications
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms
Computing Simple Paths on Points in Simple Polygons
Computational Geometry and Graph Theory
Algorithms for Computing Diffuse Reflection Paths in Polygons
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Planar rectilinear shortest path computation using corridors
Computational Geometry: Theory and Applications
Finding a rectilinear shortest path in R2using corridor based staircase structures
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
Link distance and shortest path problems in the plane
Computational Geometry: Theory and Applications
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
A nearly optimal algorithm for finding L1shortest paths among polygonal obstacles in the plane
ESA'11 Proceedings of the 19th European conference on Algorithms
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
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field
Journal of Discrete Algorithms
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
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
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Computing shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Efficient wayfinding in complex environments: derivation of a continuous space shortest path
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Computational Geometry: Theory and Applications
Hi-index | 0.00 |