[{"status":"public","title":"Surface reconstruction by wrapping finite sets in space","year":"2003","citation":{"ama":"Edelsbrunner H. Surface reconstruction by wrapping finite sets in space. In: *Discrete & Computational Geometry*. Springer; 2003:379-404. doi:10.1007/978-3-642-55566-4_17","apa":"Edelsbrunner, H. (2003). Surface reconstruction by wrapping finite sets in space. In *Discrete & Computational Geometry* (pp. 379–404). Springer. https://doi.org/10.1007/978-3-642-55566-4_17","ista":"Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete & Computational Geometry. , 379–404.","ieee":"H. Edelsbrunner, “Surface reconstruction by wrapping finite sets in space,” in *Discrete & Computational Geometry*, Springer, 2003, pp. 379–404.","short":"H. Edelsbrunner, in:, Discrete & Computational Geometry, Springer, 2003, pp. 379–404.","chicago":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” In *Discrete & Computational Geometry*, 379–404. Springer, 2003. https://doi.org/10.1007/978-3-642-55566-4_17.","mla":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” *Discrete & Computational Geometry*, Springer, 2003, pp. 379–404, doi:10.1007/978-3-642-55566-4_17."},"author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner"}],"publist_id":"2812","extern":1,"publication_status":"published","quality_controlled":0,"month":"06","_id":"3573","type":"book_chapter","day":"23","main_file_link":[{"open_access":"0","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3633"}],"date_published":"2003-06-23T00:00:00Z","publisher":"Springer","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"}],"doi":"10.1007/978-3-642-55566-4_17","date_created":"2018-12-11T12:04:02Z","page":"379 - 404","publication":"Discrete & Computational Geometry"}]