A polygon composed of line segments.

Base classes

• public std::vector< Line_segment< T, N > >

Types

• using const_reverse_iterator = typename base_type::const_reverse_iterator
• using reverse_iterator = typename base_type::reverse_iterator
• using difference_type = typename base_type::difference_type
• using size_type = typename base_type::size_type
• using const_iterator = typename base_type::const_iterator
• using iterator = typename base_type::iterator
• using const_reference = typename base_type::const_reference
• using reference = typename base_type::reference
• using const_pointer = typename base_type::const_pointer
• using pointer = typename base_type::pointer
• using value_type = typename base_type::value_type
• using scalar_type = T

Fields

• constexpr const int dimensions

Methods

• reorder() -> void
• polygon() const -> Polygon< T, N >
• gnuplot(std::ostream & out) const -> void
• simplify() -> void
• stitch() -> void
• reorder() -> void
• remove_interior() -> void
• gift_wrap() -> void

  Convex hull.

  • Uses gift wrapping algorithm [7].
  • Convex hull contains only segments from a polyline.

  Date

  2019-04-15

  Author

  Ivan Gankevich

Base classes

• public true_type

Calculate area, centroid and inertia tensor.

• Uses algorithm adapted from [4].