{"date_updated":"2022-08-09T09:46:07Z","volume":15,"extern":"1","type":"journal_article","publication_identifier":{"issn":["0178-4617"]},"_id":"4026","doi":"10.1007/BF01975867","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"last_name":"Shah","full_name":"Shah, Nimish","first_name":"Nimish"}],"publication_status":"published","publication":"Algorithmica","abstract":[{"lang":"eng","text":"A set of n weighted points in general position in R(d) defines a unique regular triangulation. This paper proves that if the points are added one by one, then flipping in a topological order will succeed in constructing this triangulation. If, in addition, the points are added in a random sequence and the history of the flips is used for locating the next point, then the algorithm takes expected time at most O(n log n + n(inverted left perpendicular d/2 inverted right perpendicular)). Under the assumption that the points and weights are independently and identically distributed, the expected running time is between proportional to and a factor log n more than the expected size of the regular triangulation. The expectation is over choosing the points and over independent coin-flips performed by the algorithm."}],"acknowledgement":"National Science Foundation under Grant CCR-8921421, Alan T. Waterman award, Grant CCR-9118874.","article_processing_charge":"No","citation":{"apa":"Edelsbrunner, H., &#38; Shah, N. (1996). Incremental topological flipping works for regular triangulations. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01975867\">https://doi.org/10.1007/BF01975867</a>","chicago":"Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping Works for Regular Triangulations.” <i>Algorithmica</i>. Springer, 1996. <a href=\"https://doi.org/10.1007/BF01975867\">https://doi.org/10.1007/BF01975867</a>.","ista":"Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.","ieee":"H. Edelsbrunner and N. Shah, “Incremental topological flipping works for regular triangulations,” <i>Algorithmica</i>, vol. 15, no. 3. Springer, pp. 223–241, 1996.","ama":"Edelsbrunner H, Shah N. Incremental topological flipping works for regular triangulations. <i>Algorithmica</i>. 1996;15(3):223-241. doi:<a href=\"https://doi.org/10.1007/BF01975867\">10.1007/BF01975867</a>","mla":"Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping Works for Regular Triangulations.” <i>Algorithmica</i>, vol. 15, no. 3, Springer, 1996, pp. 223–41, doi:<a href=\"https://doi.org/10.1007/BF01975867\">10.1007/BF01975867</a>.","short":"H. Edelsbrunner, N. Shah, Algorithmica 15 (1996) 223–241."},"month":"03","date_created":"2018-12-11T12:06:31Z","status":"public","page":"223 - 241","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publist_id":"2099","intvolume":"        15","language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","title":"Incremental topological flipping works for regular triangulations","issue":"3","oa_version":"None","article_type":"original","publisher":"Springer","year":"1996","day":"01","date_published":"1996-03-01T00:00:00Z"}