Acute triangulations of polygons
I Streinu - Discrete & Computational Geometry, 2005 - Springer
This paper proposes a combinatorial approach to planning non-colliding trajectories for a
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …
Acute Triangulations of Polygons
I Streinu - Discrete & Computational Geometry, 2005 - search.proquest.com
This paper proposes a combinatorial approach to planning non-colliding trajectories for a
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …
Acute Triangulations of Polygons
I Streinu - Discrete & Computational Geometry, 2005 - dl.acm.org
This paper proposes a combinatorial approach to planning non-colliding trajectories for a
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …
Acute Triangulations of Polygons
I Streinu - Discrete & Computational Geometry, 2005 - infona.pl
This paper proposes a combinatorial approach to planning non-colliding trajectories for a
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …
[CITATION][C] Acute Triangulations of Polygons
I Streinu - Discrete & Computational Geometry, 2005 - Springer