-
1
Approximate center points in dense point sets.
Опубликовано в: Information processing letters.Статья -
2
Note on shortest and nearest lattice vendors.
Опубликовано в: Information processing letters.Статья -
3
Finding a shortest Hamiltonian path inside a simple polygon.
Опубликовано в: Information processing letters.Статья -
4
-
5
Output-sensitive peeling of convex and maximal layers.
Опубликовано в: Information processing letters.Статья -
6
Algorithms for deciding the containment of polygons.
Опубликовано в: Information processing letters.Статья -
7
-
8
Almost tight upper bounds for vertical decompositions in four dimensions.
Опубликовано в: Journal of the ACMСтатья -
9
Lenses in arrangements of pseudo-circles and their applications.
Опубликовано в: Journal of the ACMСтатья -
10
Ray shooting amidst spheres in three dimensions and related problems.
Опубликовано в: SIAM journal on computing.Статья