Implicitly representing arrangements of lines or segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On the general motion planning problem with two degrees of freedom
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Coordinated motion planning for two independent robots
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On the two-dimensional davenport-schinzel problem
Journal of Symbolic Computation
Efficient hidden surface removal for objects with small union size
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Combinatorial complexity of translating a box in polyhedral 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
The power of geometric duality and Minkowski sums in optical computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Piecewise linear paths among convex obstacles
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On translational motion planning in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Spheres, molecules, and hidden surface removal
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Motion planning in the presence of moving obstacles
Journal of the ACM (JACM)
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
On the complexity of the union of fat objects in the plane
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Motion planning for multiple robots
Proceedings of the fourteenth annual symposium on Computational geometry
Curvature-constrained shortest paths in a convex polygon (extended abstract)
Proceedings of the fourteenth annual symposium on Computational geometry
The complexity of the union of (&agr;, &bgr;)-covered objects
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Pipes, cigars, and kreplach: the union of Minkowski sums in three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Kinetic connectivity of rectangles
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximation algorithms for curvature-constrained shortest paths
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Motion planning of a ball amid segments in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry
Online point location in planar arrangements and its applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pattern matching for sets of segments
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The union of congruent cubes in three dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Polygon decomposition for efficient construction of Minkowski sums
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
The 2-center problem with obstacles
Journal of Algorithms
The Minkowski sum of a simple polygon and a segment
Information Processing Letters
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Polygon Decomposition for Efficient Construction of Minkowski Sums
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Translating a convex polyhedron over monotone polyhedra
Computational Geometry: Theory and Applications
On conflict-free coloring of points and simple regions in the plane
Proceedings of the nineteenth annual symposium on Computational geometry
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Defining, Computing, and Visualizing Molecular Interfaces
VIS '95 Proceedings of the 6th conference on Visualization '95
Speeding up the incremental construction of the union of geometric objects in practice
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM (JACM)
Output-sensitive construction of the union of triangles
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for bichromatic separability
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On finding a guard that sees most and a shop that sells most
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On lines avoiding unit balls in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the union of κ-round objects
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
The lifting model for reconfiguration
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The visibility--voronoi complex and its applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Pianos are not flat: rigid motion planning in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the chromatic number of some geometric hypergraphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Conflict-free colorings of shallow discs
Proceedings of the twenty-second annual symposium on Computational geometry
Efficient algorithms for bichromatic separability
ACM Transactions on Algorithms (TALG)
The visibility-Voronoi complex and its applications
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Approximation algorithms for spreading points
Journal of Algorithms
Exact and approximate construction of offset polygons
Computer-Aided Design
Thick non-crossing paths and minimum-cost flows in polygonal domains
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On regular vertices on the union of planar objects
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Exact and efficient construction of planar Minkowski sums using the convolution method
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the lower envelope of bivariate functions and its applications
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
On the union of fat tetrahedra in three dimensions
Journal of the ACM (JACM)
Information-driven sensor path planning by approximate cell decomposition
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hyperfigures and their interpretations
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Arrangements in geometry: recent advances and challenges
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Domination in geometric intersection graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Better bounds on the union complexity of locally fat objects
Proceedings of the twenty-sixth annual symposium on Computational geometry
Tangencies between families of disjoint regions in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms (TALG)
A note on the perimeter of fat objects
Computational Geometry: Theory and Applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Optimal cover of points by disks in a simple polygon
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Deconstructing approximate offsets
Proceedings of the twenty-seventh annual symposium on Computational geometry
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
On isolating points using disks
ESA'11 Proceedings of the 19th European conference on Algorithms
Tangencies between families of disjoint regions in the plane
Computational Geometry: Theory and Applications
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A polynomial-time approximation algorithm for a geometric dispersion problem
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Computing shortest paths amid pseudodisks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved bounds on the union complexity of fat objects
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Conflict-Free coloring made stronger
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Finding the maximal empty disk containing a query point
Proceedings of the twenty-eighth annual symposium on Computational geometry
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters
One-way and round-trip center location problems
Discrete Optimization
Optimal Cover of Points by Disks in a Simple Polygon
SIAM Journal on Computing
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
Union of random minkowski sums and network vulnerability analysis
Proceedings of the twenty-ninth annual symposium on Computational geometry
A procedure for computing the symmetric difference of regions defined by polygonal curves
Journal of Symbolic Computation
| Hi-index | 0.01 |