| OLD | NEW |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef CC_QUADS_DRAW_POLYGON_H_ | 5 #ifndef CC_QUADS_DRAW_POLYGON_H_ |
| 6 #define CC_QUADS_DRAW_POLYGON_H_ | 6 #define CC_QUADS_DRAW_POLYGON_H_ |
| 7 | 7 |
| 8 #include <vector> | 8 #include <vector> |
| 9 | 9 |
| 10 #include "cc/base/math_util.h" | 10 #include "cc/base/math_util.h" |
| (...skipping 23 matching lines...) Expand all Loading... |
| 34 int draw_order_index = 0); | 34 int draw_order_index = 0); |
| 35 | 35 |
| 36 // Split takes this DrawPolygon and splits it into two pieces that are on | 36 // Split takes this DrawPolygon and splits it into two pieces that are on |
| 37 // either side of |splitter|. Any edges of this polygon that cross the plane | 37 // either side of |splitter|. Any edges of this polygon that cross the plane |
| 38 // of |splitter| will have an intersection point that is shared by both | 38 // of |splitter| will have an intersection point that is shared by both |
| 39 // polygons on either side. | 39 // polygons on either side. |
| 40 // Split will only return true if it determines that we got back 2 | 40 // Split will only return true if it determines that we got back 2 |
| 41 // intersection points. Only when it returns true will front and back both be | 41 // intersection points. Only when it returns true will front and back both be |
| 42 // valid new polygons that are on opposite sides of the splitting plane. | 42 // valid new polygons that are on opposite sides of the splitting plane. |
| 43 bool Split(const DrawPolygon& splitter, | 43 bool Split(const DrawPolygon& splitter, |
| 44 scoped_ptr<DrawPolygon>* front, | 44 std::unique_ptr<DrawPolygon>* front, |
| 45 scoped_ptr<DrawPolygon>* back); | 45 std::unique_ptr<DrawPolygon>* back); |
| 46 float SignedPointDistance(const gfx::Point3F& point) const; | 46 float SignedPointDistance(const gfx::Point3F& point) const; |
| 47 // Checks polygon a against polygon b and returns which side it lies on, or | 47 // Checks polygon a against polygon b and returns which side it lies on, or |
| 48 // whether it crosses (necessitating a split in the BSP tree). | 48 // whether it crosses (necessitating a split in the BSP tree). |
| 49 static BspCompareResult SideCompare(const DrawPolygon& a, | 49 static BspCompareResult SideCompare(const DrawPolygon& a, |
| 50 const DrawPolygon& b); | 50 const DrawPolygon& b); |
| 51 void ToQuads2D(std::vector<gfx::QuadF>* quads) const; | 51 void ToQuads2D(std::vector<gfx::QuadF>* quads) const; |
| 52 void TransformToScreenSpace(const gfx::Transform& transform); | 52 void TransformToScreenSpace(const gfx::Transform& transform); |
| 53 void TransformToLayerSpace(const gfx::Transform& inverse_transform); | 53 void TransformToLayerSpace(const gfx::Transform& inverse_transform); |
| 54 | 54 |
| 55 const std::vector<gfx::Point3F>& points() const { return points_; } | 55 const std::vector<gfx::Point3F>& points() const { return points_; } |
| 56 const gfx::Vector3dF& normal() const { return normal_; } | 56 const gfx::Vector3dF& normal() const { return normal_; } |
| 57 const DrawQuad* original_ref() const { return original_ref_; } | 57 const DrawQuad* original_ref() const { return original_ref_; } |
| 58 int order_index() const { return order_index_; } | 58 int order_index() const { return order_index_; } |
| 59 bool is_split() const { return is_split_; } | 59 bool is_split() const { return is_split_; } |
| 60 scoped_ptr<DrawPolygon> CreateCopy(); | 60 std::unique_ptr<DrawPolygon> CreateCopy(); |
| 61 | 61 |
| 62 void RecomputeNormalForTesting(); | 62 void RecomputeNormalForTesting(); |
| 63 | 63 |
| 64 private: | 64 private: |
| 65 void ApplyTransform(const gfx::Transform& transform); | 65 void ApplyTransform(const gfx::Transform& transform); |
| 66 void ApplyTransformToNormal(const gfx::Transform& transform); | 66 void ApplyTransformToNormal(const gfx::Transform& transform); |
| 67 | 67 |
| 68 void ConstructNormal(); | 68 void ConstructNormal(); |
| 69 | 69 |
| 70 std::vector<gfx::Point3F> points_; | 70 std::vector<gfx::Point3F> points_; |
| 71 // Normalized, necessitated by distance calculations and tests of coplanarity. | 71 // Normalized, necessitated by distance calculations and tests of coplanarity. |
| 72 gfx::Vector3dF normal_; | 72 gfx::Vector3dF normal_; |
| 73 // This is an index that can be used to test whether a quad comes before or | 73 // This is an index that can be used to test whether a quad comes before or |
| 74 // after another in document order, useful for tie-breaking when it comes | 74 // after another in document order, useful for tie-breaking when it comes |
| 75 // to coplanar surfaces. | 75 // to coplanar surfaces. |
| 76 int order_index_; | 76 int order_index_; |
| 77 // The pointer to the original quad, which gives us all the drawing info | 77 // The pointer to the original quad, which gives us all the drawing info |
| 78 // we need. | 78 // we need. |
| 79 // This DrawQuad is owned by the caller and its lifetime must be preserved | 79 // This DrawQuad is owned by the caller and its lifetime must be preserved |
| 80 // as long as this DrawPolygon is alive. | 80 // as long as this DrawPolygon is alive. |
| 81 const DrawQuad* original_ref_; | 81 const DrawQuad* original_ref_; |
| 82 bool is_split_; | 82 bool is_split_; |
| 83 }; | 83 }; |
| 84 | 84 |
| 85 } // namespace cc | 85 } // namespace cc |
| 86 | 86 |
| 87 #endif // CC_QUADS_DRAW_POLYGON_H_ | 87 #endif // CC_QUADS_DRAW_POLYGON_H_ |
| OLD | NEW |