All Questions
Tagged with constraints computational-geometry
3 questions
1
vote
1
answer
1k
views
Convex Polygon Intersection
Determining the intersection of two convex polygons is one of the fundamental problems in computational geometry .
I'm asking for an algorithm having:
INPUT:
Given two convex polygons P and Q in 2D (...
- 41
2
votes
0
answers
85
views
About Convex Geometry
A consistency notion in constraint programming:
Let $P = (X, D, C)$ be a CSP.
Given a set of variables $Y \subseteq X$ with $|Y| = k -1$, a locally consistent instantiation $I$ on $Y$ is $k$-...
- 41
8
votes
2
answers
5k
views
How to get all intersections between two simple polygons in O(n+k)
Basically the formulation of the problem I'd like to solve is very simple. Given 2 simple polygons (without self-intersections) report all intersecting edge pairs in O(n+k) time, where n - is a total ...
