메뉴 건너뛰기




Volumn 66, Issue , 2002, Pages 53-64

Hypergeometric functions in Exact Geometric Computation

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER PROGRAMMING; ERROR ANALYSIS; FUNCTIONS; PROBLEM SOLVING;

EID: 18944367594     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80378-5     Document Type: Conference Paper
Times cited : (12)

References (24)
  • 1
    • 0004267392 scopus 로고    scopus 로고
    • Cambridge University Press. Translated by Hervé Brönnimann.
    • Boissonnat J.-D., Yvinec M. Algorithmic Geometry. 1997;Cambridge University Press. Translated by Hervé Brönnimann.
    • (1997) Algorithmic Geometry
    • Boissonnat, J.-D.1    Yvinec, M.2
  • 2
    • 0031638224 scopus 로고    scopus 로고
    • Interval arithmetic yields efficient dynamic filters for Computation Geometry
    • Brönnimann H., Burnikel C., Pion S. Interval arithmetic yields efficient dynamic filters for Computation Geometry. ACM Symp. on Computational Geometry. 14:1998;165-174
    • (1998) ACM Symp. on Computational Geometry , vol.14 , pp. 165-174
    • Brönnimann, H.1    Burnikel, C.2    Pion, S.3
  • 4
    • 0012101574 scopus 로고    scopus 로고
    • A strong and easily computable separation bound for arithmetic expressi ons involving radicals
    • Burnikel C., Fleischer R., Mehlhorn K., Schirra S. A strong and easily computable separation bound for arithmetic expressi ons involving radicals. Algorithmica. 27:2000;87-99
    • (2000) Algorithmica , vol.27 , pp. 87-99
    • Burnikel, C.1    Fleischer, R.2    Mehlhorn, K.3    Schirra, S.4
  • 8
    • 84947935589 scopus 로고    scopus 로고
    • The CGAL kernel: A basis for geometric computation
    • M. C. Lin and D. Manocha, editors Berlin Springer. Lecture Notes in Computer Science No. 1148
    • A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schoenherr. The CGAL kernel: a basis for geometric computation. In M. C. Lin and D. Manocha, editors, Applied Computational Geometry: Towards Geometric Engineering, pages 191-202, Berlin, 1996. Springer. Lecture Notes in Computer Science No. 1148;
    • (1996) Applied Computational Geometry: Towards Geometric Engineering , pp. 191-202
    • Fabri, A.1    Giezeman, G.-J.2    Kettner, L.3    Schirra, S.4    Schoenherr, S.5
  • 10
    • 77956275085 scopus 로고    scopus 로고
    • Évaluation rapide de fonctions hypergéométriques
    • INRIA
    • E. Jeandel. Évaluation rapide de fonctions hypergé ométriques. Rapport Technique 242, INRIA, 2000. 17 pages.
    • (2000) Rapport Technique , vol.242 , pp. 17
    • Jeandel, E.1
  • 12
    • 64049096957 scopus 로고    scopus 로고
    • A new constructive root bound for algebraic expressions
    • ACM and SIAM, Jan.
    • C. Li and C. Yap. A new constructive root bound for algebraic expressions. In Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pages 496-505. ACM and SIAM, Jan. 2001.
    • (2001) Proc. 12th ACM-SIAM Symposium on Discrete Algorithms , pp. 496-505
    • Li, C.1    Yap, C.2
  • 14
    • 18944401715 scopus 로고    scopus 로고
    • Robust proximity queries: An illustration of degree-driven algorithm design
    • to apear
    • Liotta G., Preparata F., Tamassia R. Robust proximity queries: an illustration of degree-driven algorithm design. SIAM J. Computing. 2001;. to apear
    • (2001) SIAM J. Computing
    • Liotta, G.1    Preparata, F.2    Tamassia, R.3
  • 16
    • 0029184961 scopus 로고
    • LEDA: A platform for combinatorial and geometric computing
    • Mehlhorn K., Näher S. LEDA: a platform for combinatorial and geometric computing. CACM. 38:1995;96-102
    • (1995) CACM , vol.38 , pp. 96-102
    • Mehlhorn, K.1    Näher, S.2
  • 18
    • 84947905336 scopus 로고    scopus 로고
    • Designing the computational geometry algorithms library CGAL
    • M.C. Lin, & D. Manocha. Berlin: Springer. Lecture Notes in Computer Science No. 1148; Proc. 1st ACM Workshop on Applied Computational Geometry (WACG).
    • Overmars M. Designing the computational geometry algorithms library CGAL. Lin M.C., Manocha D. Applied Computational Geometry: Towards Geometric Engineering. 1996;53-58 Springer, Berlin. Lecture Notes in Computer Science No. 1148; Proc. 1st ACM Workshop on Applied Computational Geometry (WACG).
    • (1996) Applied Computational Geometry: Towards Geometric Engineering , pp. 53-58
    • Overmars, M.1
  • 19
    • 0037901948 scopus 로고    scopus 로고
    • Precision and robustness in geometric computations
    • M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of Geographic Information Systems Springer Chapter 9
    • S. Schirra. Precision and robustness in geometric computations. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of Geographic Information Systems, volume 1340 of Lecture Notes Comp. Science, pages 255-287. Springer, 1997. Chapter 9.
    • (1997) Lecture Notes Comp. Science , vol.1340 , pp. 255-287
    • Schirra, S.1
  • 21
    • 84860938920 scopus 로고    scopus 로고
    • A new number core for robust numerical and geometric libraries
    • Brown University. For abstracts, see
    • Yap C. A new number core for robust numerical and geometric libraries. 3rd CGC Workshop on Geometric Computing 1998. Invited Talk. Oct 11-12, 1998;Brown University. For abstracts, see http://www.cs.brown.edu/cgc/cgc98/ home.html.
    • (1998) 3rd CGC Workshop on Geometric Computing 1998. Invited Talk , vol.11
    • Yap, C.1
  • 22
    • 0003364706 scopus 로고    scopus 로고
    • Robust geometric computation
    • J.E. Goodman, & J. O'Rourke. Boca Raton, FL: CRC Press LLC
    • Yap C.K. Robust geometric computation. Goodman J.E., O'Rourke J. Handbook of Discrete and Computational Geometry, chapter 35. 1997;653-668 CRC Press LLC, Boca Raton, FL
    • (1997) Handbook of Discrete and Computational Geometry, Chapter 35 , pp. 653-668
    • Yap, C.K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.