| Tài liệu tham khảo |
Loại |
Chi tiết |
| [1] Abello, J., Estivill-Castro, V., Shermer, T., Urrutia, J.: Illumination of orthogonal polygons with orthogonal floodlights. International Journal of Computational Geometry & Applications 8, 25–38 (1998) |
Sách, tạp chí |
| Tiêu đề: |
Illumination of orthogonal polygons with orthogonal floodlights |
| Tác giả: |
Abello, J., Estivill-Castro, V., Shermer, T., Urrutia, J |
| Nhà XB: |
International Journal of Computational Geometry & Applications |
| Năm: |
1998 |
|
| [2] Agarwal, P.K., Har-Peled, S., Karia, M.: Computing approximate short- est paths on convex polytopes. Algorithmica 33, 227–242 (2002) |
Sách, tạp chí |
| Tiêu đề: |
Computing approximate shortest paths on convex polytopes |
| Tác giả: |
Agarwal, P.K., Har-Peled, S., Karia, M |
| Nhà XB: |
Algorithmica |
| Năm: |
2002 |
|
| [3] Ahadi, A., Mozafari, A., Zarei, A.: Touring a sequence of disjoint poly- gons: Complexity and extension. Theoretical Computer Science 556, 45–54 (2014) |
Sách, tạp chí |
| Tiêu đề: |
Touring a sequence of disjoint polygons: Complexity and extension |
| Tác giả: |
Ahadi, A., Mozafari, A., Zarei, A |
| Nhà XB: |
Theoretical Computer Science |
| Năm: |
2014 |
|
| [5] Ahmed, M., Lubiw, A.: Shortest descending paths: towards an exact algorithm. International Journal of Computational Geometry & Appli- cations 21, 431–466 (2011) |
Sách, tạp chí |
| Tiêu đề: |
Shortest descending paths: towards an exact algorithm |
| Tác giả: |
M. Ahmed, A. Lubiw |
| Nhà XB: |
International Journal of Computational Geometry & Applications |
| Năm: |
2011 |
|
| [6] Ahmed, M., Lubiw, A., Maheshwari, A.: Shortest gently descending paths. In: WALCOM: Algorithms and Computation, Third International Workshop, Lecture Notes in Computer Science, vol. 5431, pp. 59–70.Springer (2009) |
Sách, tạp chí |
| Tiêu đề: |
Shortest gently descending paths |
| Tác giả: |
M. Ahmed, A. Lubiw, A. Maheshwari |
| Nhà XB: |
Springer |
| Năm: |
2009 |
|
| [8] Aleksandrov, L., Maheshwari, A., Sack, J.R.: Determining approximate shortest paths on weighted polyhedral surfaces. Journal of the ACM 52, 25–53 (2005) |
Sách, tạp chí |
| Tiêu đề: |
Determining approximate shortest paths on weighted polyhedral surfaces |
| Tác giả: |
Aleksandrov, L., Maheshwari, A., Sack, J.R |
| Nhà XB: |
Journal of the ACM |
| Năm: |
2005 |
|
| [9] Allison, D.C.S., Noga, M.T.: Some performance tests of convex hull algorithms. BIT Numerical Mathematics 24, 2–13 (1984) |
Sách, tạp chí |
| Tiêu đề: |
Some performance tests of convex hull algorithms |
| Tác giả: |
D.C.S. Allison, M.T. Noga |
| Nhà XB: |
BIT Numerical Mathematics |
| Năm: |
1984 |
|
| [10] An, P.T.: Method of orienting curves for determining the convex hull of a finite set of points in the plane. Optimization 59, 175–179 (2010) [11] An, P.T.: Finding shortest paths in a sequence of triangles in 3d by themethod of orienting curves. Optimization 67(1), 159–177 (2017) |
Sách, tạp chí |
| Tiêu đề: |
Method of orienting curves for determining the convex hull of a finite set of points in the plane |
| Tác giả: |
An, P.T |
| Nhà XB: |
Optimization |
| Năm: |
2010 |
|
| [12] An, P.T.: Optimization Approaches for Computational Geometry. Se- ries of Monographs Application and Development of High-Tech. Vietnam Academy of Science and Technology (2017) |
Sách, tạp chí |
| Tiêu đề: |
Optimization Approaches for Computational Geometry |
| Tác giả: |
An, P.T |
| Nhà XB: |
Vietnam Academy of Science and Technology |
| Năm: |
2017 |
|
| [13] An, P.T., Hai, N.N., Hoai, T.V.: Direct multiple shooting method for solving approximate shortest path problems. Journal of Computational and Applied Mathematics 244, 67–76 (2013) |
Sách, tạp chí |
| Tiêu đề: |
Direct multiple shooting method for solving approximate shortest path problems |
| Tác giả: |
An, P.T., Hai, N.N., Hoai, T.V |
| Nhà XB: |
Journal of Computational and Applied Mathematics |
| Năm: |
2013 |
|
| [18] Biedl, T., Genc, B.: Reconstructing orthogonal polyhedra from putative vertex sets. Computational Geometry 44, 409–417 (2011) |
Sách, tạp chí |
| Tiêu đề: |
Reconstructing orthogonal polyhedra from putative vertex sets |
| Tác giả: |
Biedl, T., Genc, B |
| Nhà XB: |
Computational Geometry |
| Năm: |
2011 |
|
| [19] Bose, P., Maheshwari, A., Shu, C., Wuhrer, S.: A survey of geodesic paths on 3d surfaces. Computational Geometry 44(9), 486–498 (2011) [20] Breen, M.: A krasnosel’skii theorem for staircase paths in orthogonalpolygons. Journal of Geometry 51, 22–30 (1994) |
Sách, tạp chí |
| Tiêu đề: |
A survey of geodesic paths on 3d surfaces |
| Tác giả: |
P. Bose, A. Maheshwari, C. Shu, S. Wuhrer |
| Nhà XB: |
Computational Geometry |
| Năm: |
2011 |
|
| [23] Cheng, S., Jin, J.: Shortest paths on polyhedarl surfaces and terrains. In:STOC ’14 Proceedings of the 64th Annual ACM Symposium on Theory of Computing, pp. 373–382. IEEE (2014) |
Sách, tạp chí |
| Tiêu đề: |
STOC ’14 Proceedings of the 64th Annual ACM Symposium on Theory of Computing |
| Tác giả: |
Cheng, S., Jin, J |
| Nhà XB: |
IEEE |
| Năm: |
2014 |
|
| [24] Cheng, S.W., Jin, J.: Approximate shortest descending paths. In: Pro- ceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algo- rithms, pp. 144–155. SIAM (2013) |
Sách, tạp chí |
| Tiêu đề: |
Approximate shortest descending paths |
| Tác giả: |
S.W. Cheng, J. Jin |
| Nhà XB: |
SIAM |
| Năm: |
2013 |
|
| [25] Coddington, E.A., Levinson, N.: Theory of Ordinary Differential Equa- tions. Tata McGraw-Hill (1955) |
Sách, tạp chí |
| Tiêu đề: |
Theory of Ordinary Differential Equations |
| Tác giả: |
Coddington, E.A., Levinson, N |
| Nhà XB: |
Tata McGraw-Hill |
| Năm: |
1955 |
|
| [28] Gonz´ alez-Aguilar, H., Ordenand, D., P´ erez-Lantero, P., Rappaport, D., Seara, C., Tejel, J., Urrutia, J.: Maximum rectilinear convex subsets. In:Fundamentals of Computation Theory, 22nd International Symposium, pp. 274–291. Springer (2019) |
Sách, tạp chí |
| Tiêu đề: |
Maximum rectilinear convex subsets |
| Tác giả: |
González-Aguilar, H., Ordenand, D., Pérez-Lantero, P., Rappaport, D., Seara, C., Tejel, J., Urrutia, J |
| Nhà XB: |
Springer |
| Năm: |
2019 |
|
| [29] Graham, R.: An efficient algorith for determining the convex hull of a finite planar set. Information Processing Letters 1, 132–133 (1972) [30] Gr¨ unbaum, B.: Convex Polytopes. Springer (2003) |
Sách, tạp chí |
| Tiêu đề: |
Convex Polytopes |
| Tác giả: |
Grünbaum, B |
| Nhà XB: |
Springer |
| Năm: |
2003 |
|
| [32] Hai, N.N., An, P.T., Huyen, P.T.T.: Shortest paths along a sequence of line segments in euclidean spaces. Journal of Convex Analysis 26(4), 1089–1112 (2019) |
Sách, tạp chí |
| Tiêu đề: |
Shortest paths along a sequence of line segments in euclidean spaces |
| Tác giả: |
Hai, N.N., An, P.T., Huyen, P.T.T |
| Nhà XB: |
Journal of Convex Analysis |
| Năm: |
2019 |
|
| [33] Hearn, D.D., Baker, P., Warren Carithers, W.: Computer Graphics with Open GL. Person (2014) |
Sách, tạp chí |
| Tiêu đề: |
Computer Graphics with Open GL |
| Tác giả: |
Hearn, D.D., Baker, P., Warren Carithers, W |
| Nhà XB: |
Person |
| Năm: |
2014 |
|
| [36] Lang, S., Murrow, G.: Geometry: A High School Course. Springer Sciene+Business Media, LLC (1988) |
Sách, tạp chí |
| Tiêu đề: |
Geometry: A High School Course |
| Tác giả: |
S. Lang, G. Murrow |
| Nhà XB: |
Springer Science+Business Media, LLC |
| Năm: |
1988 |
|