{"year":"2003","month":"06","publisher":"Springer","day":"23","main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3633","open_access":"0"}],"quality_controlled":0,"title":"Surface reconstruction by wrapping finite sets in space","citation":{"short":"H. Edelsbrunner, in:, Discrete &#38; Computational Geometry, Springer, 2003, pp. 379–404.","mla":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” <i>Discrete &#38; Computational Geometry</i>, Springer, 2003, pp. 379–404, doi:<a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">10.1007/978-3-642-55566-4_17</a>.","ama":"Edelsbrunner H. Surface reconstruction by wrapping finite sets in space. In: <i>Discrete &#38; Computational Geometry</i>. Springer; 2003:379-404. doi:<a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">10.1007/978-3-642-55566-4_17</a>","ieee":"H. Edelsbrunner, “Surface reconstruction by wrapping finite sets in space,” in <i>Discrete &#38; Computational Geometry</i>, Springer, 2003, pp. 379–404.","chicago":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” In <i>Discrete &#38; Computational Geometry</i>, 379–404. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">https://doi.org/10.1007/978-3-642-55566-4_17</a>.","ista":"Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete &#38; Computational Geometry. , 379–404.","apa":"Edelsbrunner, H. (2003). Surface reconstruction by wrapping finite sets in space. In <i>Discrete &#38; Computational Geometry</i> (pp. 379–404). Springer. <a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">https://doi.org/10.1007/978-3-642-55566-4_17</a>"},"date_published":"2003-06-23T00:00:00Z","extern":1,"doi":"10.1007/978-3-642-55566-4_17","type":"book_chapter","page":"379 - 404","_id":"3573","publication":"Discrete & Computational Geometry","publication_status":"published","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Herbert Edelsbrunner"}],"date_created":"2018-12-11T12:04:02Z","status":"public","publist_id":"2812","date_updated":"2021-01-12T07:44:24Z","abstract":[{"text":"Given a finite point set in R, the surface reconstruction problem asks for a surface that passes through many but not necessarily all points. We describe an unambigu- ous definition of such a surface in geometric and topological terms, and sketch a fast algorithm for constructing it. Our solution overcomes past limitations to special point distributions and heuristic design decisions.","lang":"eng"}]}