TriangulationPoint.cs 2.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
  1. /* Poly2Tri
  2. * Copyright (c) 2009-2010, Poly2Tri Contributors
  3. * http://code.google.com/p/poly2tri/
  4. *
  5. * All rights reserved.
  6. *
  7. * Redistribution and use in source and binary forms, with or without modification,
  8. * are permitted provided that the following conditions are met:
  9. *
  10. * * Redistributions of source code must retain the above copyright notice,
  11. * this list of conditions and the following disclaimer.
  12. * * Redistributions in binary form must reproduce the above copyright notice,
  13. * this list of conditions and the following disclaimer in the documentation
  14. * and/or other materials provided with the distribution.
  15. * * Neither the name of Poly2Tri nor the names of its contributors may be
  16. * used to endorse or promote products derived from this software without specific
  17. * prior written permission.
  18. *
  19. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  20. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  21. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  22. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  23. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  24. * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  25. * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  26. * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  27. * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  28. * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  29. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  30. */
  31. using System.Collections.Generic;
  32. using Poly2Tri.Triangulation.Delaunay.Sweep;
  33. namespace Poly2Tri.Triangulation
  34. {
  35. public class TriangulationPoint
  36. {
  37. // List of edges this point constitutes an upper ending point (CDT)
  38. public double X, Y;
  39. public TriangulationPoint(double x, double y)
  40. {
  41. X = x;
  42. Y = y;
  43. }
  44. public List<DTSweepConstraint> Edges { get; private set; }
  45. public float Xf
  46. {
  47. get { return (float) X; }
  48. set { X = value; }
  49. }
  50. public float Yf
  51. {
  52. get { return (float) Y; }
  53. set { Y = value; }
  54. }
  55. public bool HasEdges
  56. {
  57. get { return Edges != null; }
  58. }
  59. public override string ToString()
  60. {
  61. return "[" + X + "," + Y + "]";
  62. }
  63. public void AddEdge(DTSweepConstraint e)
  64. {
  65. if (Edges == null)
  66. {
  67. Edges = new List<DTSweepConstraint>();
  68. }
  69. Edges.Add(e);
  70. }
  71. }
  72. }