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
|
/*************************************************************************
* 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
*************************************************************************/
#pragma once
#include <neatogen/sparsegraph.h>
#include <util/api.h>
typedef struct {
int nedges; /* no. of edges in triangulation */
int* edges; /* 2*nsegs indices of points */
int nfaces; /* no. of faces in triangulation */
int* faces; /* 3*nfaces indices of points */
int* neigh; /* 3*nfaces indices of neighbor triangles */
} surface_t;
PRIVATE int *delaunay_tri (double *x, double *y, int n, int* nedges);
PRIVATE int *get_triangles (double *x, int n, int* ntris);
PRIVATE v_data *UG_graph(double *x, double *y, int n);
PRIVATE surface_t* mkSurface (double *x, double *y, int n, int* segs, int nsegs);
PRIVATE void freeSurface (surface_t* s);
|
