Skip to main content

All Questions

Filter by
Sorted by
Tagged with
20 votes
2 answers
25k views

Partitioning a polygon into convex parts

I'm looking for an algorithm to partition any simple closed polygon into convex sub-polygons--preferably as few as possible. I know almost nothing about this subject, so I've been searching on Google ...
user14059's user avatar
  • 201
2 votes
1 answer
173 views

Calculating the "Belvedere Hull" of a Simple Planar Polygon

As an informal motivation the problem, imagine a tower with polygonal footprint, that is located in a beautiful landscape, the "Belvedere Hull" is then related to the directions, in which one would ...
Manfred Weis's user avatar
  • 13.2k
1 vote
0 answers
66 views

Non-Convex Polygons with "Antipodal Visibility"

by "antipodal visibility" of planar, simple polygons I mean the following property: if two points $p$ and $q$ on the polygon's boundary divide the polygon's boundary into two polylines of equal length,...
Manfred Weis's user avatar
  • 13.2k