-
1
-
-
84957666373
-
An ε-approximation algorithm for weighted shortest paths on polyhedral surfaces
-
L. Aleksandrov, M. Lanthier, A. Maheshwari, and J.-R. Sack, "An ε-approximation algorithm for weighted shortest paths on polyhedral surfaces," Proc. of the 6th Scandinavian Workshop on Algorithm Theory, pp. 11-22, 1998.
-
(1998)
Proc. of the 6th Scandinavian Workshop on Algorithm Theory
, pp. 11-22
-
-
Aleksandrov, L.1
Lanthier, M.2
Maheshwari, A.3
Sack, J.-R.4
-
2
-
-
0003505509
-
Walking in an arrangement topologically
-
T. Asano, L.J. Guibas and T. Tokuyama, "Walking in an arrangement topologically," Int. Journal of Computational Geometry and Applications, Vol. 4, pp. 123-151, 1994.
-
(1994)
Int. Journal of Computational Geometry and Applications
, vol.4
, pp. 123-151
-
-
Asano, T.1
Guibas, L.J.2
Tokuyama, T.3
-
4
-
-
0033075662
-
Computing the optimal bridge between two convex polygons
-
L. Cai, Y. Xu and B. Zhu, "Computing the optimal bridge between two convex polygons," Information processing letters, Vol. 69, pp. 127-130, 1999.
-
(1999)
Information Processing Letters
, vol.69
, pp. 127-130
-
-
Cai, L.1
Xu, Y.2
Zhu, B.3
-
5
-
-
84886825108
-
-
web page at
-
The Computational Geometry Algorithms Library, web page at http://www.cgal.org.
-
-
-
-
6
-
-
0026460645
-
An optimal algorithm for intersecting line segments in the plane
-
B. Chazelle and H. Edelsbrunner, "An optimal algorithm for intersecting line segments in the plane," Journal of ACM, Vol. 39, pp. 1-54, 1992.
-
(1992)
Journal of ACM
, vol.39
, pp. 1-54
-
-
Chazelle, B.1
Edelsbrunner, H.2
-
7
-
-
0043285301
-
Determining an optimal penetration among weighted regions in two and three dimensions
-
D.Z. Chen, O. Daescu, X. Hu, X. Wu and J. Xu, "Determining an optimal penetration among weighted regions in two and three dimensions," Journal of Combinatorial Optimization, Spec. Issue on Optimization Problems in Medical Applications, Vol. 5, No. 1, 2001, pp. 59-79.
-
(2001)
Journal of Combinatorial Optimization, Spec. Issue on Optimization Problems in Medical Applications
, vol.5
, Issue.1
, pp. 59-79
-
-
Chen, D.Z.1
Daescu, O.2
Hu, X.3
Wu, X.4
Xu, J.5
-
8
-
-
0033875246
-
Optimizing the sum of linear fractional functions and applications
-
D.Z. Chen, O. Daescu, Y. Dai, N. Katoh, X. Wu and J. Xu, "Optimizing the sum of linear fractional functions and applications," Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 707-716, 2000.
-
(2000)
Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms
, pp. 707-716
-
-
Chen, D.Z.1
Daescu, O.2
Dai, Y.3
Katoh, N.4
Wu, X.5
Xu, J.6
-
11
-
-
0000722742
-
The 3D visibility complex, a new approach to the problems of accurate visibility
-
F. Durand, G. Drettakis, and C. Puech, "The 3D visibility complex, a new approach to the problems of accurate visibility," Proc. of 7th Eurographic Workshop on Rendering, pp. 245-257, 1996.
-
(1996)
Proc. of 7th Eurographic Workshop on Rendering
, pp. 245-257
-
-
Durand, F.1
Drettakis, G.2
Puech, C.3
-
12
-
-
0030656853
-
The visibility skeleton: A powerful and efficient multi-purpose global visibility tool
-
F. Durand, G. Drettakis, and C. Puech, "The visibility skeleton: a powerful and efficient multi-purpose global visibility tool," Proc. ACM SIGGRAPH, pp. 89-100, 1997.
-
(1997)
Proc. ACM SIGGRAPH
, pp. 89-100
-
-
Durand, F.1
Drettakis, G.2
Puech, C.3
-
13
-
-
0024606073
-
Topologically sweeping an arrangement
-
H. Edelsbrunner, and L.J. Guibas, "Topologically sweeping an arrangement," Journal of Computer and System Sciences, Vol. 38, pp. 165-194, 1989.
-
(1989)
Journal of Computer and System Sciences
, vol.38
, pp. 165-194
-
-
Edelsbrunner, H.1
Guibas, L.J.2
-
15
-
-
0028347564
-
A generalized pencil beam algorithm for optimization of radiation therapy
-
A. Gustafsson, B.K. Lind and A. Brahme, "A generalized pencil beam algorithm for optimization of radiation therapy," Med. Phys., Vol. 21, pp. 343-356, 1994.
-
(1994)
Med. Phys.
, vol.21
, pp. 343-356
-
-
Gustafsson, A.1
Lind, B.K.2
Brahme, A.3
-
17
-
-
0030706472
-
Approximating weighted shortest paths on polyhedral surfaces
-
M. Lanthier, A. Maheshwari, and J.-R. Sack, "Approximating weighted shortest paths on polyhedral surfaces," Proc. of the 13th ACM Symp. on Comp. Geom., pp. 274-283, 1997.
-
(1997)
Proc. of the 13th ACM Symp. on Comp. Geom.
, pp. 274-283
-
-
Lanthier, M.1
Maheshwari, A.2
Sack, J.-R.3
-
18
-
-
0030651636
-
A new algorithm for computing shortest paths in weighted planar subdivisions
-
C. Mata, and J.S.B. Mitchell, "A new algorithm for computing shortest paths in weighted planar subdivisions," Proc. of the 13th ACM Symp. on Comp. Geom., pp. 264-273, 1997.
-
(1997)
Proc. of the 13th ACM Symp. on Comp. Geom.
, pp. 264-273
-
-
Mata, C.1
Mitchell, J.S.B.2
-
19
-
-
0002008783
-
Geometric Shortest Paths and Network Optimization
-
Elsevier Science J.-R. Sack and J. Urrutia, eds.
-
J.S.B. Mitchell, "Geometric Shortest Paths and Network Optimization," Handbook of Computational Geometry, Elsevier Science (J.-R. Sack and J. Urrutia, eds.), 2000.
-
(2000)
Handbook of Computational Geometry
-
-
Mitchell, J.S.B.1
-
20
-
-
0025800853
-
The weighted region problem: Finding shortest paths through a weighted planar subdivision
-
J.S.B. Mitchell and C.H. Papadimitriou, "The weighted region problem: Finding shortest paths through a weighted planar subdivision," Journal of ACM, Vol. 38, pp. 18-73, 1991.
-
(1991)
Journal of ACM
, vol.38
, pp. 18-73
-
-
Mitchell, J.S.B.1
Papadimitriou, C.H.2
-
21
-
-
0027846801
-
Motion planning in stereotactic radiosurgery
-
A. Schweikard, J.R. Adler and J.C. Latombe, "Motion planning in stereotactic radiosurgery," IEEE Transactions on Robotics and Automation, Vol. 9, pp. 764-774, 1993.
-
(1993)
IEEE Transactions on Robotics and Automation
, vol.9
, pp. 764-774
-
-
Schweikard, A.1
Adler, J.R.2
Latombe, J.C.3
|