inside.c 1.3 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152
  1. /*
  2. ****************************************************************************
  3. *
  4. * MODULE: Vector library
  5. *
  6. * AUTHOR(S): Original author CERL, probably Dave Gerdes.
  7. * Update to GRASS 5.7 Radim Blazek.
  8. *
  9. * PURPOSE: Lower level functions for reading/writing/manipulating vectors.
  10. *
  11. * COPYRIGHT: (C) 2001 by the GRASS Development Team
  12. *
  13. * This program is free software under the GNU General Public
  14. * License (>=v2). Read the file COPYING that comes with GRASS
  15. * for details.
  16. *
  17. *****************************************************************************/
  18. #include <grass/vector.h>
  19. double
  20. dig_x_intersect(double beg_x,
  21. double end_x, double beg_y, double end_y, double Y)
  22. {
  23. double b;
  24. /* assumes beg_y != end_y */
  25. /* sort for numerical stability */
  26. if (end_x < beg_x || (end_x == beg_x && end_y < beg_y)) {
  27. b = end_x;
  28. end_x = beg_x;
  29. beg_x = b;
  30. b = end_y;
  31. end_y = beg_y;
  32. beg_y = b;
  33. }
  34. /* solve simple linear equation to get X = a + b * Y
  35. * with
  36. * b = (end_x - beg_x) / (end_y - beg_y)
  37. * a = beg_x - b * beg_y
  38. *
  39. * simplify a + b * Y:
  40. * a + b * Y = beg_x - b * beg_y + b * Y
  41. * a + b * Y = beg_x + b * (Y - beg_y) */
  42. b = (end_x - beg_x) / (end_y - beg_y);
  43. return beg_x + b * (Y - beg_y);
  44. }