-
1
-
-
0038559781
-
Voronoi diagram for services neighboring a highway
-
M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe, L. Ma, B. Palop, and V. Sacristán Voronoi diagram for services neighboring a highway Information Processing Letters 86 2003 283 288
-
(2003)
Information Processing Letters
, vol.86
, pp. 283-288
-
-
Abellanas, M.1
Hurtado, F.2
Icking, C.3
Klein, R.4
Langetepe, E.5
Ma, L.6
Palop, B.7
Sacristán, V.8
-
4
-
-
84921152398
-
Planar geometric location problems and maintaining the width of a planar set
-
P.K. Agarwal, M. Sharir, Planar geometric location problems and maintaining the width of a planar set, in: Proc. SODA91, 1991, pp. 449-458
-
(1991)
Proc. SODA91
, pp. 449-458
-
-
Agarwal, P.K.1
Sharir, M.2
-
5
-
-
48249139926
-
Constructing optimal highways
-
CRPIT
-
H.-K. Ahn, H. Alt, T. Asano, S.W. Bae, P. Brass, O. Cheong, C. Knauer, H.-S. Na, C.-S. Shin, A. Wolff, Constructing optimal highways, in: Proc. 13th Conf. Computing: The Australasian Theory Symposium (CATS), vol 65, CRPIT, 2007, pp. 7-14
-
(2007)
Proc. 13th Conf. Computing: The Australasian Theory Symposium (CATS)
, vol.65
, pp. 7-14
-
-
Ahn, H.-K.1
Alt, H.2
Asano, T.3
Bae, S.W.4
Brass, P.5
Cheong, O.6
Knauer, C.7
Na, H.-S.8
Shin, C.-S.9
Wolff, A.10
-
6
-
-
1142300704
-
Quickest paths, straight skeletons, and the city Voronoi diagram
-
O. Aichholzer, F. Aurenhammer, and B. Palop Quickest paths, straight skeletons, and the city Voronoi diagram Discrete & Computational Geometry 31 1 2004 17 35
-
(2004)
Discrete & Computational Geometry
, vol.31
, Issue.1
, pp. 17-35
-
-
Aichholzer, O.1
Aurenhammer, F.2
Palop, B.3
-
9
-
-
0033461748
-
Geometric applications of a randomized optimization technique
-
(SoCG special issue)
-
T.M. Chan Geometric applications of a randomized optimization technique Discrete & Computational Geometry 22 1999 547 567 (SoCG special issue)
-
(1999)
Discrete & Computational Geometry
, vol.22
, pp. 547-567
-
-
Chan, T.M.1
-
14
-
-
0030785136
-
Faster construction of planar two-centers
-
ACM and SIAM
-
D. Eppstein Faster construction of planar two-centers Proc. 8th Symp. Discrete Algorithms 1997 ACM and SIAM 131 138
-
(1997)
Proc. 8th Symp. Discrete Algorithms
, pp. 131-138
-
-
Eppstein, D.1
-
20
-
-
1542500714
-
A subexponential bound for linear programming
-
J. Matousek, M. Sharir, and E. Welzl A subexponential bound for linear programming Algorithmica 16 1996 498 516
-
(1996)
Algorithmica
, vol.16
, pp. 498-516
-
-
Matousek, J.1
Sharir, M.2
Welzl, E.3
-
21
-
-
84867982851
-
An optimal randomized algorithm for d-variate zonoid depth
-
P. Morin An optimal randomized algorithm for d-variate zonoid depth Computational Geometry 39 3 2008 229 235
-
(2008)
Computational Geometry
, vol.39
, Issue.3
, pp. 229-235
-
-
Morin, P.1
-
22
-
-
4243419672
-
Computational geometry and facility location
-
J.-M. Robert, G.T. Toussaint, Computational geometry and facility location, in: Proc. International Conf. on Operations Research and Management Science, vol. B, 1990, pp. 1-19
-
(1990)
Proc. International Conf. on Operations Research and Management Science
, vol.B
, pp. 1-19
-
-
Robert, J.-M.1
Toussaint, G.T.2
-
23
-
-
84976669340
-
Planar point location using persistent search trees
-
N. Sarnak, and R.E. Tarjanm Planar point location using persistent search trees Communications of the ACM 29 7 1986 669 679
-
(1986)
Communications of the ACM
, vol.29
, Issue.7
, pp. 669-679
-
-
Sarnak, N.1
Tarjanm, R.E.2
-
25
-
-
0020879121
-
Solving geometric problems with the "rotating calipers"
-
G.T. Toussaint, Solving geometric problems with the "rotating calipers", in: Proc. MELECON, 1983
-
(1983)
Proc. MELECON
-
-
Toussaint, G.T.1
|