Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximate minimum weight Steiner triangulation in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Separation-sensitive collision detection for convex objects
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for searching a polygonal region with a flashlight
Proceedings of the sixteenth annual symposium on Computational geometry
Finite-resolution hidden surface removal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for intersection searching and fractional cascading in higher dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Finding the shortest boundary guard of a simple polygon
Theoretical Computer Science
Testing Homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry
Motorcycle graphs and straight skeletons
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
On the Reflexivity of Point Sets
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Output-Sensitive Algorithms for Uniform Partitions of Points
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Facility Location Constrained to a Polygonal Domain
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Terrain Polygon Decomposition, with Application to Layered Manufacturing
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Planar Graph Blocking for External Searching
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
TSP with Neighborhoods of Varying Size
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Touring a sequence of polygons
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Minimizing the stabbing number of matchings, trees, and triangulations
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for intersection searching and fractional cascading in higher dimension
Journal of Computer and System Sciences - STOC 2001
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
Dynamic topological predicates and notifications in moving objects databases
Proceedings of the 6th international conference on Mobile data management
TSP with neighborhoods of varying size
Journal of Algorithms
Minimum weight pseudo-triangulations
Computational Geometry: Theory and Applications
Query-point visibility constrained shortest paths in simple polygons
Theoretical Computer Science
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Light orthogonal networks with constant geometric dilation
Journal of Discrete Algorithms
Optimal higher order Delaunay triangulations of polygons
Computational Geometry: Theory and Applications
Shooting permanent rays among disjoint polygons in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Visibility queries in a polygonal region
Computational Geometry: Theory and Applications
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
Covering a simple polygon by monotone directions
Computational Geometry: Theory and Applications
TSP with neighborhoods of varying size
Journal of Algorithms
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Optimal higher order Delaunay triangulations of polygons
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Stabbers of line segments in the plane
Computational Geometry: Theory and Applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
The stochastic walk algorithms for point location in pseudo-triangulations
Advances in Engineering Software
Throwing stones inside simple polygons
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Orthogonal subdivisions with low stabbing numbers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Guarding art galleries by guarding witnesses
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
Exact solutions and bounds for general art gallery problems
Journal of Experimental Algorithmics (JEA)
Tracing compressed curves in triangulated surfaces
Proceedings of the twenty-eighth annual symposium on Computational geometry
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
A faster algorithm for computing motorcycle graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
Quickest path queries on transportation network
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Visibility and ray shooting queries in polygonal domains
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |