1 |
/*
|
2 |
* This file is a part of Poly2Tri-C
|
3 |
* (c) Barak Itkin <lightningismyname@gmail.com>
|
4 |
* http://code.google.com/p/poly2tri-c/
|
5 |
*
|
6 |
* All rights reserved.
|
7 |
*
|
8 |
* Redistribution and use in source and binary forms, with or without modification,
|
9 |
* are permitted provided that the following conditions are met:
|
10 |
*
|
11 |
* * Redistributions of source code must retain the above copyright notice,
|
12 |
* this list of conditions and the following disclaimer.
|
13 |
* * Redistributions in binary form must reproduce the above copyright notice,
|
14 |
* this list of conditions and the following disclaimer in the documentation
|
15 |
* and/or other materials provided with the distribution.
|
16 |
* * Neither the name of Poly2Tri nor the names of its contributors may be
|
17 |
* used to endorse or promote products derived from this software without specific
|
18 |
* prior written permission.
|
19 |
*
|
20 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
21 |
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
22 |
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
23 |
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
24 |
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
25 |
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
26 |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
27 |
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
28 |
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
29 |
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
30 |
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
31 |
*/
|
32 |
|
33 |
#ifndef __P2TC_REFINE_EDGE_H__
|
34 |
#define __P2TC_REFINE_EDGE_H__
|
35 |
|
36 |
#include <glib.h>
|
37 |
#include "circle.h"
|
38 |
#include "triangulation.h"
|
39 |
|
40 |
/**
|
41 |
* @struct P2trEdge_
|
42 |
* A struct for an edge in a triangular mesh
|
43 |
*/
|
44 |
struct P2trEdge_
|
45 |
{
|
46 |
/** The end point of this mesh */
|
47 |
P2trPoint *end;
|
48 |
|
49 |
/** The edge going in the opposite direction from this edge */
|
50 |
P2trEdge *mirror;
|
51 |
|
52 |
/** Is this a constrained edge? */
|
53 |
gboolean constrained;
|
54 |
|
55 |
/** The triangle where this edge goes clockwise along its outline */
|
56 |
P2trTriangle *tri;
|
57 |
|
58 |
/**
|
59 |
* The angle of the direction of this edge. Although it can be
|
60 |
* computed anytime using atan2 on the vector of this edge, we cache
|
61 |
* it here since it's heavily used and the computation is expensive.
|
62 |
* The angle increases as we go CCW, and it's in the range [-PI,+PI]
|
63 |
*/
|
64 |
gdouble angle;
|
65 |
|
66 |
/**
|
67 |
* Is this edge a delaunay edge? This field is used by the refinement
|
68 |
* algorithm and should not be used elsewhere!
|
69 |
*/
|
70 |
gboolean delaunay;
|
71 |
|
72 |
/** A count of references to the edge */
|
73 |
guint refcount;
|
74 |
};
|
75 |
|
76 |
#define P2TR_EDGE_START(E) ((E)->mirror->end)
|
77 |
|
78 |
P2trEdge* p2tr_edge_new (P2trPoint *start,
|
79 |
P2trPoint *end,
|
80 |
gboolean constrained);
|
81 |
|
82 |
P2trEdge* p2tr_edge_ref (P2trEdge *self);
|
83 |
|
84 |
void p2tr_edge_unref (P2trEdge *self);
|
85 |
|
86 |
void p2tr_edge_free (P2trEdge *self);
|
87 |
|
88 |
void p2tr_edge_remove (P2trEdge *self);
|
89 |
|
90 |
P2trMesh* p2tr_edge_get_mesh (P2trEdge *self);
|
91 |
|
92 |
gboolean p2tr_edge_is_removed (P2trEdge *self);
|
93 |
|
94 |
gdouble p2tr_edge_get_length (P2trEdge* self);
|
95 |
|
96 |
gdouble p2tr_edge_get_length_squared (P2trEdge* self);
|
97 |
|
98 |
gdouble p2tr_edge_angle_between (P2trEdge *e1,
|
99 |
P2trEdge *e2);
|
100 |
|
101 |
gdouble p2tr_edge_angle_between_positive (P2trEdge *e1,
|
102 |
P2trEdge *e2);
|
103 |
|
104 |
#endif
|