# Shape Intersection Function Library (Programming/Geometry)

We need a programmer who knows geometry and mathematics very well to write us 29 methods in the C# language.

These methods must be relatively self-contained, but may rely on the C#//NET Math library (No P/Invokes or system functions as shortcuts). In addition, they should be as computationally inexpensive as possible.

These methods work with the following 2-dimensional shapes: polygon, rectangle, circle; and non-shapes: line-segment and point (XY). We need a intersection and containment methods that return True/False for all possible combinations. The polygons we are working with use all straight-edges and may be concave or convex (but no bezier curves, and thus should be represented as an array of line segments). We understand that a rectangle is a polygon, but we also know there are computationally less-expensive ways to work with rectangles, which is why we've separated them.

ACCEPTANCE CRITERIA

-Prior to acceptance for payment we will perform out own tests using these methods on our machinery. As long as the tests pass and are clearly optimized to run quickly, you're set.

-You must utilize the method names and arguments as defined. There should be no need for us to pass extra arguments or solve certain values ourselves beyond the description of the shapes/lines/points.

INTERSECTION METHODS

Description:

The intersection methods described below must utilize the arguments as shown, and should return only a True/False value of whether the shapes intersect. The intersection test must include scenarios where one shape is completely within another shape (treated as an intersection). There is not a need to determine the points of intersection.

[poly] arguments should be treated as an array of lines (each element of which has an X1, Y1, X2, Y2 value).

Method Definitions:

*See attached document..

CONTAINMENT METHODS

Description:

The containment methods described below must utilize the arguments as shown, and should return only a True/False value of whether the second shape is fully contained within the first (all edges equal to or within the boundaries). This is different than the intersection methods, where boundaries may cross inside and outside of the shapes.

[poly] arguments should be treated as an array of lines (each element of which has an X1, Y1, X2, Y2 value).

Method Definitions:

*See attached document..

Skills: .NET, Algorithm, C# Programming, Mathematics

Project ID: #4181407

## 27 freelancers are bidding on average \$375 for this job

OShuqair

\$400 USD in 10 days
(77 Reviews)
7.1
proteamspb

Hi, our team has experience in C#. Also members of our team have strong mathematical background.

\$500 USD in 25 days
(16 Reviews)
5.8
ravenspoint

I have implemented all the intersection methods. If you accept my bid, I will implement the containment methods. Private messages contain: 1) Code implementing a sampling of the methods, 2) Basic test code for all th More

\$400 USD in 20 days
(16 Reviews)
5.9
ValueCoders

Hi, Experts team of SEO/Wordpress/PHP/joomla/Drupal developers and designers. Please check PM for detail. Thanks Gaurav

\$300 USD in 20 days
(22 Reviews)
5.5
dobreiiita

Hello, I am expert and dedicated in C# development along with strong mathematical skills.I am very much interested for your project. I can complete your project quickly and efficiently in time.

\$350 USD in 12 days
(56 Reviews)
5.2
romei

Hello, I am a professional .NET programmer based in Bytom, Poland. I fully understand the requirements and scope of your project. Please check out my private message in which I've provided a working code sample. Thank More

\$435 USD in 10 days
(4 Reviews)
4.9
GraphicsApp

\$350 USD in 15 days
(9 Reviews)
4.9
Schura

\$400 USD in 30 days
(23 Reviews)
4.6
TDA91

\$400 USD in 30 days
(7 Reviews)
4.2
sahogenk

Hi, i help you Implementing IEquatable, Area struct, shape the query, natural linear shape reflects and many more.

\$400 USD in 15 days
(4 Reviews)
4.1
aegansys

windows developer (c/c++/c#)

\$150 USD in 2 days
(5 Reviews)
3.5
tomaszkarwala

It looks attractive! Polygon-polygon intersection and containment are of the most concern for performance. For these, I can implement for you sweep line-type algorithms which are O(n log n) in the total number of verti More

\$600 USD in 21 days
(3 Reviews)
3.3
kodegun

\$100 USD in 2 days
(4 Reviews)
2.3
vedenev

I am experienced programer: http://simulations.narod.ru/

\$900 USD in 21 days
(2 Reviews)
1.5
belgasoft2

Hi, Please see my personal message. Regards BELGASOFT

\$400 USD in 15 days
(0 Reviews)
0.0
masud426

My objective is not just to earn money but to earn satisfaction, faith, trust and appreciation of my employer.

\$350 USD in 7 days
(0 Reviews)
0.0
abolshabab

It WAS MY GRADUATION PROJECT FROM UNIVERSITY !! Let's start RIGHT NOW if you are serious :)

\$130 USD in 7 days
(0 Reviews)
0.0
artisticoder

\$380 USD in 10 days
(0 Reviews)
0.0
AyaRa

Hello, I'm a computer science graduate, so I believe I have the required experience. Ayat

\$250 USD in 21 days
(0 Reviews)
0.0
dipalinilam

I can finish this work with your quality requirement. Please see PM.

\$350 USD in 15 days
(0 Reviews)
0.0