1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
/*************************************************************************
* Copyright (c) 2011 AT&T Intellectual Property
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-v10.html
*
* Contributors: Details at https://graphviz.org
*************************************************************************/
#include <stdbool.h>
#include <stddef.h>
#ifdef __cplusplus
extern "C" {
#endif
#include <pathgeom.h>
#ifdef GVDLL
#ifdef PATHPLAN_EXPORTS
#define TRI_API __declspec(dllexport)
#else
#define TRI_API __declspec(dllimport)
#endif
#endif
#ifndef TRI_API
#define TRI_API /* nothing */
#endif
/* Points in polygon must be in CCW order */
TRI_API int Ptriangulate(Ppoly_t *polygon,
void (*fn)(void *closure, const Ppoint_t tri[]),
void *vc);
#undef TRI_API
/// return value from `ccw`
enum {
ISCCW = 1, ///< counter-clockwise
ISCW = 2, ///< clockwise
ISON = 3, ///< co-linear
};
/// are the given points counter-clockwise, clockwise, or co-linear?
int ccw(Ppoint_t p1, Ppoint_t p2, Ppoint_t p3);
typedef Ppoint_t (*indexer_t)(void *base, size_t index);
/// is (i, i + 2) a diagonal?
bool isdiagonal(size_t i, size_t ip2, void *pointp, size_t pointn,
indexer_t indexer);
#ifdef __cplusplus
}
#endif
|
