Computing the betti numbers of arrangements in practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3718 LNCS, Issue , 2005, Pages 13-31

  Basu, Saugata ^a   Kettner, Michael ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; POLYNOMIALS; SET THEORY;

ELLIPSOIDS; FIRST BETTI NUMBERS; SEMI-ALGEBRAIC SETS;

NUMBER THEORY;

EID: 33744906081     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11555964_2     Document Type: Conference Paper

References (16)

1. D. S. Arnon, G. E. Collins, and S. McCallum. Cylindrical algebraic decomposition. I. The basic algorithm. SIAM J. Comput., 13(4):865-877, 1984.
2. D. S. Arnon, G. E. Collins, and S. McCallum. Cylindrical algebraic decomposition. II. An adjacency algorithm for the plane. SIAM J. Comput., 13(4):878-889, 1984.
3. D. S. Arnon, G. E. Collins, and S. McCallum. An adjacency algorithm for cylindrical algebraic decompositions of three-dimensional space. J. Symbolic Comput., 5(1-2): 163-187, 1988.
4. S. Basu. Computing the Betti numbers of arrangements via spectral sequences. J. Comput. System Sci., 67(2):244-262, 2003. Special issue on STOC2002 (Montreal, QC).
5. S. Basu. Computing the first few Betti numbers of semi-algebraic sets in single exponential time. Preprint, 2005.
6. S. Basu. Computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities in polynomial time. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, 2005.
7. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in real algebraic geometry, volume 10 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, 2003.
8. S. Basu, R. Pollack, and M.-F. Roy. Computing the first Betti number and the connected components of semi-algebraic sets. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, 2005.
9. C. W. Brown. An overview of QEPCAD B: a tool for real quantifier elimination and formula simplification. Journal of Japan Society for Symbolic and Algebraic Computation, 10(1):13-22, 2003.
10. G. Carlsson, A. Zomorodian, A. Collins, and L. Guibas. Persistence barcodes for shapes. In SGP '04: Proceedings of the &004 Eurographics/ACM SIGGRAPH Symposium on Geometric Processing, pages 124-135, New York, NY, USA, 2004. ACM Press.
11. B. Chazelle, H. Edelsbrunner, L. J. Guibas, and M. Sharir. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications. Theoretical Computer Science, 84:77-105, 1991.
12. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata theory and formal languages (Second GI Conf., Kaiserslautern, 1975), pages 134-183. Lecture Notes in Comput. Sci., Vol. 33. Springer, Berlin, 1975.
13. H. Edelsbrunner. The union of balls and its dual shape. Discrete Comput. Geom., 13(3-4):415-440, 1995.
14. E. Fortuna, P. Gianni, P. Parenti, and C. Traverso. Algorithms to compute the topology of orientable real algebraic surfaces. J. Symbolic Comput., 36(3-4):343-364, 2003.
15. D. Halperin. Arrangements. In Handbook of discrete and computational geometry, CRC Press Ser. Discrete Math. Appl., pages 389-412. CRC, Boca Raton, FL, 1997.
16. V. Koltun. Sharp bounds for vertical decompositions of linear arrangements in four dimensions. Discrete Comput. Geom., 31(3):435-460, 2004.