<< problem 101 - Optimum polynomial | Special subset sums: optimum - problem 103 >> |
Problem 102: Triangle containment
(see projecteuler.net/problem=102)
Three distinct points are plotted at random on a Cartesian plane, for which -1000 <= x, y <= 1000, such that a triangle is formed.
Consider the following two triangles:
A(-340,495), B(-153,-910), C(835,-947)
X(-175,41), Y(-421,-714), Z(574,-645)
It can be verified that triangle \triangle ABC contains the origin, whereas triangle \triangle XYZ does not.
Using triangles.txt (right click and 'Save Link/Target As...'), a 27K text file containing the co-ordinates of one thousand "random" triangles,
find the number of triangles for which the interior contains the origin.
NOTE: The first two examples in the file represent the triangles in the example given above.
My Algorithm
I had a substantial number of lectures on Computer Graphics, so this was a very easy problem ...
Just for fun I implemented two algorithms: one is based on the dot product and one on barycentric coordinates.
Algorithm isInside
is based on the dot product (en.wikipedia.org/wiki/Dot_product) and needs the helper function dot
.
A line (x1,y1)-(x2,y2) divides the 2D into two disjunct half-planes P_+ and P_-.
Any point p_1 \in P_+ has a positive sign whereas any point p_2 \in P_- has a negative sign and is zero if p_3 lies on the line.
(Actually you can extend this formula to compute the distance of that point from the line).
Computing the dot product of a point p regarding each side of the triangle must has the same sign if p is inside the triangle.
My code handle the general case for any p, not just the origin at (0,0).
Algorithm isInside2
evaluates the barycentric coordinates (en.wikipedia.org/wiki/Barycentric_coordinate_system) of a point p in relation to a triangle.
If the barycentric coordinates a_p, b_p and c_p are between 0 and 1 then p is inside the triangle.
Alternative Approaches
Some people compute the area A_{ABC} of the original triangle \triangle ABC.
If P is inside \triangle ABC then its area equals the sum of the areas of \triangle ABP, \triangle APC and \triangle PBC:
A_{ABC} = A_{ABP} + A_{APC} + A_{PBC}
If you check thousands of points against the same triangle then you should think about finding the bounding box (en.wikipedia.org/wiki/Minimum_bounding_box).
Note
Any point on the edges of a triangle is considered to be inside the triangle.
I prefer the dot product solution because it's less prone to rounding artifacts.
Actually you can write an integer-only version because it doesn't need division.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This live test is based on the Hackerrank problem.
This is equivalent toecho "2 -340 495 -153 -910 835 -947 -175 41 -421 -714 574 -645" | ./102
Output:
(this interactive test is still under development, computations will be aborted after one second)
My code
… was written in C++ and can be compiled with G++, Clang++, Visual C++. You can download it, as well as the input data, too.
The code contains #ifdef
s to switch between the original problem and the Hackerrank version.
Enable #ifdef ORIGINAL
to produce the result for the original problem (default setting for most problems).
#include <iostream>
//#define ORIGINAL
// compute dot-product
double dot(double x, double y, double x1, double y1, double x2, double y2)
{
return (y2 - y1)*(x - x1) + (x1 - x2)*(y - y1);
}
// return true if point (x,y) is inside the triangle (x1,y1),(x2,y2),(x3,y3)
// uses dot-product
bool isInside(double x, double y, double x1, double y1, double x2, double y2, double x3, double y3)
{
bool sign1 = dot(x,y, x1,y1, x2,y2) >= 0;
bool sign2 = dot(x,y, x2,y2, x3,y3) >= 0;
bool sign3 = dot(x,y, x3,y3, x1,y1) >= 0;
return (sign1 == sign2) && (sign2 == sign3);
}
// same as above but based on barycentric coordinates
bool isInside2(double x, double y, double x1, double y1, double x2, double y2, double x3, double y3)
{
double denominator = (y2 - y3)*(x1 - x3) + (x3 - x2)*(y1 - y3);
double a = ((y2 - y3)*(x - x3) + (x3 - x2)*(y - y3)) / denominator;
double b = ((y3 - y1)*(x - x3) + (x1 - x3)*(y - y3)) / denominator;
double c = 1 - a - b;
return 0 <= a && a <= 1 &&
0 <= b && b <= 1 &&
0 <= c && c <= 1;
}
int main()
{
// number of triangles where the origin is inside
unsigned int numInside = 0;
unsigned int tests = 1000;
#ifndef ORIGINAL
std::cin >> tests;
#endif
while (tests--)
{
int x1,y1,x2,y2,x3,y3;
#ifdef ORIGINAL
// numbers in CSV format
char comma;
std::cin >> x1 >> comma >> y1 >> comma >> x2 >> comma >> y2 >> comma >> x3 >> comma >> y3;
#else
// numbers separated by spaces
std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;
#endif
// both algorithms return the same results
if (isInside(0,0, x1,y1, x2,y2, x3,y3))
numInside++;
//if (isInside2(0,0, x1,y1, x2,y2, x3,y3))
// numInside++;
}
std::cout << numInside << std::endl;
return 0;
}
This solution contains 13 empty lines, 11 comments and 6 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in less than 0.01 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
(compiled for x86_64 / Linux, GCC flags: -O3 -march=native -fno-exceptions -fno-rtti -std=gnu++11 -DORIGINAL
)
See here for a comparison of all solutions.
Note: interactive tests run on a weaker (=slower) computer. Some interactive tests are compiled without -DORIGINAL
.
Changelog
May 11, 2017 submitted solution
May 11, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler102
My code solves 7 out of 7 test cases (score: 100%)
Difficulty
Project Euler ranks this problem at 15% (out of 100%).
Hackerrank describes this problem as easy.
Note:
Hackerrank has strict execution time limits (typically 2 seconds for C++ code) and often a much wider input range than the original problem.
In my opinion, Hackerrank's modified problems are usually a lot harder to solve. As a rule thumb: brute-force is rarely an option.
Links
projecteuler.net/thread=102 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
C# www.mathblog.dk/project-euler-102-triangles-contain-origin/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/102.cs (written by Haochen Liu)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-102.py (written by Hugh Brown)
Python github.com/LaurentMazare/ProjectEuler/blob/master/e102.py (written by Laurent Mazare)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p102.py (written by Nayuki)
C++ github.com/Meng-Gen/ProjectEuler/blob/master/102.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/102.cpp (written by Yuping Luo)
C++ github.com/zmwangx/Project-Euler/blob/master/102/102.cpp (written by Zhiming Wang)
Java github.com/dcrousso/ProjectEuler/blob/master/PE102.java (written by Devin Rousso)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p102.java (written by Nayuki)
Java github.com/thrap/project-euler/blob/master/src/Java/Problem102.java (written by Magnus Solheim Thrap)
Go github.com/frrad/project-euler/blob/master/golang/Problem102.go (written by Frederick Robinson)
Mathematica github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p102.mathematica (written by Nayuki)
Mathematica github.com/steve98654/ProjectEuler/blob/master/102.nb
Haskell github.com/nayuki/Project-Euler-solutions/blob/master/haskell/p102.hs (written by Nayuki)
Scala github.com/samskivert/euler-scala/blob/master/Euler102.scala (written by Michael Bayne)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p102.rs
Those links are just an unordered selection of source code I found with a semi-automatic search script on Google/Bing/GitHub/whatever.
You will probably stumble upon better solutions when searching on your own. Maybe not all linked resources produce the correct result and/or exceed time/memory limits.
Heatmap
Please click on a problem's number to open my solution to that problem:
green | solutions solve the original Project Euler problem and have a perfect score of 100% at Hackerrank, too | |
yellow | solutions score less than 100% at Hackerrank (but still solve the original problem easily) | |
gray | problems are already solved but I haven't published my solution yet | |
blue | solutions are relevant for Project Euler only: there wasn't a Hackerrank version of it (at the time I solved it) or it differed too much | |
orange | problems are solved but exceed the time limit of one minute or the memory limit of 256 MByte | |
red | problems are not solved yet but I wrote a simulation to approximate the result or verified at least the given example - usually I sketched a few ideas, too | |
black | problems are solved but access to the solution is blocked for a few days until the next problem is published | |
[new] | the flashing problem is the one I solved most recently |
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 |
51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 |
76 | 77 | 78 | 79 | 80 | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 | 90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 99 | 100 |
101 | 102 | 103 | 104 | 105 | 106 | 107 | 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 116 | 117 | 118 | 119 | 120 | 121 | 122 | 123 | 124 | 125 |
126 | 127 | 128 | 129 | 130 | 131 | 132 | 133 | 134 | 135 | 136 | 137 | 138 | 139 | 140 | 141 | 142 | 143 | 144 | 145 | 146 | 147 | 148 | 149 | 150 |
151 | 152 | 153 | 154 | 155 | 156 | 157 | 158 | 159 | 160 | 161 | 162 | 163 | 164 | 165 | 166 | 167 | 168 | 169 | 170 | 171 | 172 | 173 | 174 | 175 |
176 | 177 | 178 | 179 | 180 | 181 | 182 | 183 | 184 | 185 | 186 | 187 | 188 | 189 | 190 | 191 | 192 | 193 | 194 | 195 | 196 | 197 | 198 | 199 | 200 |
201 | 202 | 203 | 204 | 205 | 206 | 207 | 208 | 209 | 210 | 211 | 212 | 213 | 214 | 215 | 216 | 217 | 218 | 219 | 220 | 221 | 222 | 223 | 224 | 225 |
226 | 227 | 228 | 229 | 230 | 231 | 232 | 233 | 234 | 235 | 236 | 237 | 238 | 239 | 240 | 241 | 242 | 243 | 244 | 245 | 246 | 247 | 248 | 249 | 250 |
251 | 252 | 253 | 254 | 255 | 256 | 257 | 258 | 259 | 260 | 261 | 262 | 263 | 264 | 265 | 266 | 267 | 268 | 269 | 270 | 271 | 272 | 273 | 274 | 275 |
276 | 277 | 278 | 279 | 280 | 281 | 282 | 283 | 284 | 285 | 286 | 287 | 288 | 289 | 290 | 291 | 292 | 293 | 294 | 295 | 296 | 297 | 298 | 299 | 300 |
301 | 302 | 303 | 304 | 305 | 306 | 307 | 308 | 309 | 310 | 311 | 312 | 313 | 314 | 315 | 316 | 317 | 318 | 319 | 320 | 321 | 322 | 323 | 324 | 325 |
326 | 327 | 328 | 329 | 330 | 331 | 332 | 333 | 334 | 335 | 336 | 337 | 338 | 339 | 340 | 341 | 342 | 343 | 344 | 345 | 346 | 347 | 348 | 349 | 350 |
351 | 352 | 353 | 354 | 355 | 356 | 357 | 358 | 359 | 360 | 361 | 362 | 363 | 364 | 365 | 366 | 367 | 368 | 369 | 370 | 371 | 372 | 373 | 374 | 375 |
376 | 377 | 378 | 379 | 380 | 381 | 382 | 383 | 384 | 385 | 386 | 387 | 388 | 389 | 390 | 391 | 392 | 393 | 394 | 395 | 396 | 397 | 398 | 399 | 400 |
401 | 402 | 403 | 404 | 405 | 406 | 407 | 408 | 409 | 410 | 411 | 412 | 413 | 414 | 415 | 416 | 417 | 418 | 419 | 420 | 421 | 422 | 423 | 424 | 425 |
426 | 427 | 428 | 429 | 430 | 431 | 432 | 433 | 434 | 435 | 436 | 437 | 438 | 439 | 440 | 441 | 442 | 443 | 444 | 445 | 446 | 447 | 448 | 449 | 450 |
451 | 452 | 453 | 454 | 455 | 456 | 457 | 458 | 459 | 460 | 461 | 462 | 463 | 464 | 465 | 466 | 467 | 468 | 469 | 470 | 471 | 472 | 473 | 474 | 475 |
476 | 477 | 478 | 479 | 480 | 481 | 482 | 483 | 484 | 485 | 486 | 487 | 488 | 489 | 490 | 491 | 492 | 493 | 494 | 495 | 496 | 497 | 498 | 499 | 500 |
501 | 502 | 503 | 504 | 505 | 506 | 507 | 508 | 509 | 510 | 511 | 512 | 513 | 514 | 515 | 516 | 517 | 518 | 519 | 520 | 521 | 522 | 523 | 524 | 525 |
526 | 527 | 528 | 529 | 530 | 531 | 532 | 533 | 534 | 535 | 536 | 537 | 538 | 539 | 540 | 541 | 542 | 543 | 544 | 545 | 546 | 547 | 548 | 549 | 550 |
551 | 552 | 553 | 554 | 555 | 556 | 557 | 558 | 559 | 560 | 561 | 562 | 563 | 564 | 565 | 566 | 567 | 568 | 569 | 570 | 571 | 572 | 573 | 574 | 575 |
576 | 577 | 578 | 579 | 580 | 581 | 582 | 583 | 584 | 585 | 586 | 587 | 588 | 589 | 590 | 591 | 592 | 593 | 594 | 595 | 596 | 597 | 598 | 599 | 600 |
601 | 602 | 603 | 604 | 605 | 606 | 607 | 608 | 609 | 610 | 611 | 612 | 613 | 614 | 615 | 616 |
I scored 13526 points (out of 15700 possible points, top rank was 17 out of ≈60000 in August 2017) at Hackerrank's Project Euler+.
My username at Project Euler is stephanbrumme while it's stbrumme at Hackerrank.
Look at my progress and performance pages to get more details.
Copyright
I hope you enjoy my code and learn something - or give me feedback how I can improve my solutions.
All of my solutions can be used for any purpose and I am in no way liable for any damages caused.
You can even remove my name and claim it's yours. But then you shall burn in hell.
The problems and most of the problems' images were created by Project Euler.
Thanks for all their endless effort !!!
<< problem 101 - Optimum polynomial | Special subset sums: optimum - problem 103 >> |