A convex polygon is a simple polygon whose interior is a convex set. In a convex polygon ,every internal angle is less than or equal to 180 degrees and every line segment between two vertices remains inside or on the boundary of the polygon.
Questions tagged [convex-polygon]
99 questions
0
votes
1 answer
Calculate width of convex polygon at specific angle
What is a way that I can calculate the width of a convex polygon given its vertices and some angle? The purpose of this is to find the cross sectional width of a polygon moving at some velocity in order to calculate some kind of air drag during a…
kevinrstone
- 266
- 2
- 12
0
votes
2 answers
Google maps v3 - Draw a polygon to show photo take angle
I am displaying in google maps (v3) markers with the position where the photograph was taken and position of the subject and tracing a line to show direction in which photo was taken. I have also calculated the distance and the angle from camera…
user2033838
- 153
- 1
- 10
0
votes
1 answer
Algorithm to partition an area - find points close to each other
Is there an algorithm to find all points with a set distance from each other ? Or all rectangles that are touching ?
I divide the plane (in lat/lon coordinate system, of certain limits) in sample rectangles of n x n, and each rectangle gets a value…
Thalia
- 13,637
- 22
- 96
- 190
0
votes
1 answer
How can extract points which are formed a convex hull of 3 dimensions polygon in Matlab by using convexhull functions?
I use different convex hull functions in Matlab to find points coordinates which are formed the convex hull. however, these functions return the matrix of triangles.
How can I specify those points?
Thanks.
Sepideh
Sepideh
- 11
- 2
-1
votes
1 answer
algorithm for forming a convex polygon
I am trying to find an algorithm that would take a sequence of edge lengths as input and form a convex polygon with these edges. I know that such convex does not always exist, but I am working with data where it should exist.
Basically I am trying…
Andres Traumann
- 144
- 1
- 8
-2
votes
1 answer
How to check point is present inside a polygon if points are not aligned correctly?
I was working on a question In which we have to find the convex hull of given N points and check whether another P point is present in a polygon or not. So I implemented the Jarvis march gift wrapping algorithm. So, It returned output with correctly…
Aniket Kulkarni
- 13
- 3
-2
votes
1 answer
Convex Hull reading XY co-ords in Python
I need to come up with a convex hull algorithm to read through a bunch of X , Y co-ordinates and outline the image..
i'm coding in python
Any ideas?
Tara
- 1
- 1
-2
votes
1 answer
How to get all points constituting convex hull,if convex hull is perfect rectangle(python 3)?
open image to see result of below code
import numpy as np
from scipy.spatial import ConvexHull
import matplotlib.pyplot as plt
points = np.array([[1,1],[1,2],[1,3],[1,4],[2,1],[2,2],[2,3],[2,4],[3,1],[3,2],[3,3],[3,4],[4,1],[4,2],[4,3],[4,4]]) …
Sanket Chafle
- 11
- 2
-7
votes
2 answers
What is the purpose of "!" in this code from "Point in Polygon Test"?
Point in Polygon Test Code
int pnpoly(int nvert, float *vertx, float *verty, float testx, float testy)
{
int i, j, c = 0;
for (i = 0, j = nvert-1; i < nvert; j = i++) {
if ( ((verty[i]>testy) != (verty[j]>testy)) &&
(testx <…
snowpeak
- 797
- 9
- 25