Abstract
Motivated by motion planning applications, we study 2-dimensional surfaces embedded in 3-dimensional space with the property that their vertical projection is an immersion. We provide bounds on the complexity of a triangulation of such a surface, given that the projection of the boundary is a polygon with m segments. We then show how these bounds lead to efficient algorithm to compute such a triangulation. Finally, we relate our result to concrete motion planning setting and review related open questions.
Original language | English |
---|---|
Pages | 66:1-6 |
Publication status | Published - 2018 |
Event | 34th European Workshop on Computational Geometry - Berlin, Germany Duration: 21 Mar 2018 → 23 Mar 2018 |
Conference
Conference | 34th European Workshop on Computational Geometry |
---|---|
Abbreviated title | EuroCG 2018 |
Country/Territory | Germany |
City | Berlin |
Period | 21/03/18 → 23/03/18 |