- Slice the square into 8 rectangles with horizontal cuts.
- Slice the square into 8 rectangles with vertical cuts.
- Slice the square into 4 smaller squares with one horizontal and one vertical cut, then divide each square into two pieces with a single cut each.
- Do some other series of 3 cuts that achieves the upper bound of 7 in the lazy caterer's sequence then make one cut that divides one of the pieces in two.
Divide area into polygons
9 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
Paschalis Garouniatis
el 8 de Abr. de 2020
Comentada: Paschalis Garouniatis
el 25 de Abr. de 2020
Hello everyone. Supposing there is a square area (x,y coordinates) given by the user is it possible to divide the area into non overlapping polygons (let's say 8 polygons for example) and then check which polygon contains a single pair of coordinates? In the meantime i am trying to figure it out and if there is any progress I will post it as a comment. Any help is most welcome. Thanks in advance.
0 comentarios
Respuesta aceptada
Steven Lord
el 8 de Abr. de 2020
Many different ways.
What requirements do you have on the polygons into which you want to cut the square?
4 comentarios
Más respuestas (0)
Ver también
Categorías
Más información sobre Voronoi Diagram en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!