TriangulationContext.cs 2.9 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
  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 Veldrid.Common.Poly2Tri.Triangulation.Delaunay;
  33. using Veldrid.Common.Poly2Tri.Triangulation.Delaunay.Sweep;
  34. namespace Veldrid.Common.Poly2Tri.Triangulation
  35. {
  36. public abstract class TriangulationContext {
  37. public TriangulationDebugContext DebugContext { get; protected set; }
  38. public readonly List<DelaunayTriangle> Triangles = new List<DelaunayTriangle>();
  39. public readonly List<TriangulationPoint> Points = new List<TriangulationPoint>(200);
  40. public TriangulationMode TriangulationMode { get; protected set; }
  41. public Triangulatable Triangulatable { get; private set; }
  42. public int StepCount { get; private set; }
  43. public void Done() {
  44. StepCount++;
  45. }
  46. public abstract TriangulationAlgorithm Algorithm { get; }
  47. public virtual void PrepareTriangulation(Triangulatable t) {
  48. Triangulatable = t;
  49. TriangulationMode = t.TriangulationMode;
  50. t.Prepare(this);
  51. }
  52. public abstract TriangulationConstraint NewConstraint(TriangulationPoint a, TriangulationPoint b);
  53. public void Update(string message) {}
  54. public virtual void Clear() {
  55. Points.Clear();
  56. if (DebugContext != null) DebugContext.Clear();
  57. StepCount = 0;
  58. }
  59. public virtual bool IsDebugEnabled { get; protected set; }
  60. public DTSweepDebugContext DTDebugContext { get { return DebugContext as DTSweepDebugContext; } }
  61. }
  62. }