AAAAAA
Results:
1-9
|
Results: 9
Authors:
Barequet, G
Har-Peled, S
Citation: G. Barequet et S. Har-peled, Polygon containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard, INT J C GEO, 11(4), 2001, pp. 465-474
Authors:
Barequet, G
Har-Peled, S
Citation: G. Barequet et S. Har-peled, Efficiently approximating the minimum-volume bounding box of a point set in three dimensions, J ALGORITHM, 38(1), 2001, pp. 91-109
Authors:
Har-Peled, S
Sharir, M
Citation: S. Har-peled et M. Sharir, Online point location in planar arrangements and its applications, DISC COM G, 26(1), 2001, pp. 19-40
Authors:
Agarwal, PK
Aronov, B
Har-Peled, S
Sharir, M
Citation: Pk. Agarwal et al., Approximation algorithms for minimum-width annuli and shells, DISC COM G, 24(4), 2000, pp. 687-705
Authors:
Har-Peled, S
Citation: S. Har-peled, Taking a walk in a planar arrangement, SIAM J COMP, 30(4), 2000, pp. 1341-1367
Authors:
Har-Peled, S
Citation: S. Har-peled, Constructing planar cuttings in theory and practice, SIAM J COMP, 29(6), 2000, pp. 2016-2039
Authors:
Har-Peled, S
Citation: S. Har-peled, Multicolor Combination Lemma, COMP GEOM, 12(3-4), 1999, pp. 155-176
Authors:
Har-Peled, S
Citation: S. Har-peled, Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions, DISC COM G, 21(2), 1999, pp. 217-231
Authors:
Har-Peled, S
Citation: S. Har-peled, Constructing approximate shortest path maps in three dimensions, SIAM J COMP, 28(4), 1999, pp. 1182-1197
Risultati:
1-9
|