{"scopus_import":"1","extern":"1","publication":"Computer Aided Geometric Design","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/016783969500016Y?via%3Dihub"}],"language":[{"iso":"eng"}],"title":"An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere","intvolume":" 12","citation":{"short":"C. Delfinado, H. Edelsbrunner, Computer Aided Geometric Design 12 (1995) 771–784.","ista":"Delfinado C, Edelsbrunner H. 1995. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Computer Aided Geometric Design. 12(7), 771–784.","apa":"Delfinado, C., & Edelsbrunner, H. (1995). An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Computer Aided Geometric Design. Elsevier. https://doi.org/10.1016/0167-8396(95)00016-Y","chicago":"Delfinado, Cecil, and Herbert Edelsbrunner. “An Incremental Algorithm for Betti Numbers of Simplicial Complexes on the 3-Sphere.” Computer Aided Geometric Design. Elsevier, 1995. https://doi.org/10.1016/0167-8396(95)00016-Y.","mla":"Delfinado, Cecil, and Herbert Edelsbrunner. “An Incremental Algorithm for Betti Numbers of Simplicial Complexes on the 3-Sphere.” Computer Aided Geometric Design, vol. 12, no. 7, Elsevier, 1995, pp. 771–84, doi:10.1016/0167-8396(95)00016-Y.","ieee":"C. Delfinado and H. Edelsbrunner, “An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere,” Computer Aided Geometric Design, vol. 12, no. 7. Elsevier, pp. 771–784, 1995.","ama":"Delfinado C, Edelsbrunner H. An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere. Computer Aided Geometric Design. 1995;12(7):771-784. doi:10.1016/0167-8396(95)00016-Y"},"article_processing_charge":"No","date_updated":"2022-06-24T09:49:32Z","type":"journal_article","publist_id":"2096","oa_version":"None","abstract":[{"text":"A general and direct method for computing the Betti numbers of a finite simplicial complex in Bd is given. This method is complete for d less than or equal to 3, where versions of this method run in time O(n alpha(n)) and O(n), n the number of simplices. An implementation of the algorithm is applied to alpha shapes, which is a novel geometric modeling tool.","lang":"eng"}],"issue":"7","doi":"10.1016/0167-8396(95)00016-Y","author":[{"last_name":"Delfinado","first_name":"Cecil","full_name":"Delfinado, Cecil"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"year":"1995","page":"771 - 784","article_type":"original","day":"01","_id":"4029","publication_status":"published","volume":12,"quality_controlled":"1","date_created":"2018-12-11T12:06:32Z","status":"public","publication_identifier":{"issn":["0167-8396"]},"date_published":"1995-11-01T00:00:00Z","month":"11","publisher":"Elsevier","acknowledgement":"This work is supported by the National Science Foundation under grant ASC-9200301 and the Alan T. Waterman award, grant CCR-9118874. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the authors and do not necessarily reflect the view of the National Science Foundation.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"}