mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-08-04 13:13:25 +03:00
f2006a6f19
Added custom meshing core algorithm to generate base mesh using Delabella library, which can be enabled via IMeshTools_Parameters::MeshAlgo option or CSF_MeshAlgo environment variable. Do not fill cirles filter upon explicit initialization. Call base postProcessMesh functionality after initialization of circles in BRepMesh_CustomDelaunayBaseMeshAlgo. Added Vsprintf() wrapper for vsprintf() preserving C locale.
91 lines
4.0 KiB
Plaintext
91 lines
4.0 KiB
Plaintext
/*
|
|
|
|
MIT License
|
|
|
|
DELABELLA - Delaunay triangulation library
|
|
Copyright (C) 2018 GUMIX - Marcin Sokalski
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included in all
|
|
copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
SOFTWARE.
|
|
|
|
*/
|
|
|
|
#ifndef DELABELLA_H
|
|
#define DELABELLA_H
|
|
|
|
// returns: positive value: number of triangle indices, negative: number of line segment indices (degenerated input)
|
|
// triangle indices in abc array are always returned in clockwise order
|
|
// DEPRECIATED. move to new API either extern "C" or IDelaBella (C++)
|
|
int DelaBella(int points, const double* xy/*[points][2]*/, int* abc/*[2*points-5][3]*/, int (*errlog)(const char* fmt,...) = printf);
|
|
|
|
struct DelaBella_Vertex
|
|
{
|
|
int i; // index of original point
|
|
double x, y; // coordinates (input copy)
|
|
DelaBella_Vertex* next; // next silhouette vertex
|
|
};
|
|
|
|
struct DelaBella_Triangle
|
|
{
|
|
DelaBella_Vertex* v[3]; // 3 vertices spanning this triangle
|
|
DelaBella_Triangle* f[3]; // 3 adjacent faces, f[i] is at the edge opposite to vertex v[i]
|
|
DelaBella_Triangle* next; // next triangle (of delaunay set or hull set)
|
|
};
|
|
|
|
#ifdef __cplusplus
|
|
struct IDelaBella
|
|
{
|
|
static IDelaBella* Create();
|
|
|
|
virtual void Destroy() = 0;
|
|
|
|
virtual void SetErrLog(int(*proc)(void* stream, const char* fmt, ...), void* stream) = 0;
|
|
|
|
// return 0: no output
|
|
// negative: all points are colinear, output hull vertices form colinear segment list, no triangles on output
|
|
// positive: output hull vertices form counter-clockwise ordered segment contour, delaunay and hull triangles are available
|
|
// if 'y' pointer is null, y coords are treated to be located immediately after every x
|
|
// if advance_bytes is less than 2*sizeof coordinate type, it is treated as 2*sizeof coordinate type
|
|
virtual int Triangulate(int points, const float* x, const float* y = 0, int advance_bytes = 0) = 0;
|
|
virtual int Triangulate(int points, const double* x, const double* y = 0, int advance_bytes = 0) = 0;
|
|
|
|
// num of points passed to last call to Triangulate()
|
|
virtual int GetNumInputPoints() const = 0;
|
|
|
|
// num of verts returned from last call to Triangulate()
|
|
virtual int GetNumOutputVerts() const = 0;
|
|
|
|
virtual const DelaBella_Triangle* GetFirstDelaunayTriangle() const = 0; // valid only if Triangulate() > 0
|
|
virtual const DelaBella_Triangle* GetFirstHullTriangle() const = 0; // valid only if Triangulate() > 0
|
|
virtual const DelaBella_Vertex* GetFirstHullVertex() const = 0; // if Triangulate() < 0 it is list, otherwise closed contour!
|
|
};
|
|
#else
|
|
void* DelaBella_Create();
|
|
void DelaBella_Destroy(void* db);
|
|
void DelaBella_SetErrLog(void* db, int(*proc)(void* stream, const char* fmt, ...), void* stream);
|
|
int DelaBella_TriangulateFloat(void* db, int points, float* x, float* y = 0, int advance_bytes = 0);
|
|
int DelaBella_TriangulateDouble(void* db, int points, double* x, double* y = 0, int advance_bytes = 0);
|
|
int DelaBella_GetNumInputPoints(void* db);
|
|
int DelaBella_GetNumOutputVerts(void* db);
|
|
const DelaBella_Triangle* GetFirstDelaunayTriangle(void* db);
|
|
const DelaBella_Triangle* GetFirstHullTriangle(void* db);
|
|
const DelaBella_Vertex* GetFirstHullVertex(void* db);
|
|
#endif
|
|
|
|
#endif
|