GeezerVison is showing github.com — solvespace_python/src/polygon.h at master · sg-dev1/solvespace_python

Expand file tree

polygon.h

Copy path

More file actions

Latest commit

History

420 lines (334 loc) · 11.4 KB

polygon.h

Copy path

File metadata and controls

420 lines (334 loc) · 11.4 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

//-----------------------------------------------------------------------------

// Anything relating to plane polygons and triangles, and (generally, non-

// planar) meshes thereof.

//-----------------------------------------------------------------------------

#ifndef SOLVESPACE_POLYGON_H

#define SOLVESPACE_POLYGON_H

class SPointList;

class SPolygon;

class SContour;

class SMesh;

class SBsp3;

class SOutlineList;

enum class EarType : uint32_t {

UNKNOWN = 0,

NOT_EAR = 1,

EAR = 2

};

enum class BspClass : uint32_t {

POS = 100,

NEG = 101,

COPLANAR = 200

};

enum class EdgeKind : uint32_t {

NAKED_OR_SELF_INTER = 100,

SELF_INTER = 200,

TURNING = 300,

EMPHASIZED = 400,

SHARP = 500,

};

class SEdge {

public:

int tag;

int auxA, auxB;

Vector a, b;

static SEdge From(Vector a, Vector b);

bool EdgeCrosses(Vector a, Vector b, Vector *pi=NULL, SPointList *spl=NULL) const;

};

class SEdgeList {

public:

List<SEdge> l;

void Clear();

void AddEdge(Vector a, Vector b, int auxA=0, int auxB=0, int tag=0);

bool AssemblePolygon(SPolygon *dest, SEdge *errorAt, bool keepDir=false) const;

bool AssembleContour(Vector first, Vector last, SContour *dest,

SEdge *errorAt, bool keepDir, int start) const;

int AnyEdgeCrossings(Vector a, Vector b,

Vector *pi=NULL, SPointList *spl=NULL) const;

bool ContainsEdgeFrom(const SEdgeList *sel) const;

bool ContainsEdge(const SEdge *se) const;

void CullExtraneousEdges(bool both=true);

void MergeCollinearSegments(Vector a, Vector b);

};

// A kd-tree element needs to go on a side of a node if it's when KDTREE_EPS

// of the boundary. So increasing this number never breaks anything, but may

// result in more duplicated elements. So it's conservative to be sloppy here.

#define KDTREE_EPS (20*LENGTH_EPS)

class SEdgeLl {

public:

SEdge *se;

SEdgeLl *next;

static SEdgeLl *Alloc();

};

class SKdNodeEdges {

public:

int which; // whether c is x, y, or z

double c;

SKdNodeEdges *gt;

SKdNodeEdges *lt;

SEdgeLl *edges;

static SKdNodeEdges *From(SEdgeList *sel);

static SKdNodeEdges *From(SEdgeLl *sell);

static SKdNodeEdges *Alloc();

int AnyEdgeCrossings(Vector a, Vector b, int cnt,

Vector *pi=NULL, SPointList *spl=NULL) const;

};

class SPoint {

public:

int tag;

EarType ear;

Vector p;

Vector auxv;

};

class SPointList {

public:

List<SPoint> l;

void Clear();

bool ContainsPoint(Vector pt) const;

int IndexForPoint(Vector pt) const;

void IncrementTagFor(Vector pt);

void Add(Vector pt);

};

class SContour {

public:

int tag;

int timesEnclosed;

Vector xminPt;

List<SPoint> l;

void AddPoint(Vector p);

void MakeEdgesInto(SEdgeList *el) const;

void Reverse();

Vector ComputeNormal() const;

double SignedAreaProjdToNormal(Vector n) const;

bool IsClockwiseProjdToNormal(Vector n) const;

bool ContainsPointProjdToNormal(Vector n, Vector p) const;

void OffsetInto(SContour *dest, double r) const;

void CopyInto(SContour *dest) const;

void FindPointWithMinX();

Vector AnyEdgeMidpoint() const;

bool IsEmptyTriangle(int ap, int bp, int cp, double scaledEPS) const;

bool IsEar(int bp, double scaledEps) const;

bool BridgeToContour(SContour *sc, SEdgeList *el, List<Vector> *vl);

void ClipEarInto(SMesh *m, int bp, double scaledEps);

void UvTriangulateInto(SMesh *m, SSurface *srf);

};

typedef struct {

uint32_t face;

RgbaColor color;

} STriMeta;

class SPolygon {

public:

List<SContour> l;

Vector normal;

Vector ComputeNormal() const;

void AddEmptyContour();

size_t WindingNumberForPoint(Vector p) const;

double SignedArea() const;

bool ContainsPoint(Vector p) const;

void MakeEdgesInto(SEdgeList *el) const;

void FixContourDirections();

void Clear();

bool SelfIntersecting(Vector *intersectsAt) const;

bool IsEmpty() const;

Vector AnyPoint() const;

void OffsetInto(SPolygon *dest, double r) const;

void UvTriangulateInto(SMesh *m, SSurface *srf);

void UvGridTriangulateInto(SMesh *m, SSurface *srf);

void TriangulateInto(SMesh *m) const;

void InverseTransformInto(SPolygon *sp, Vector u, Vector v, Vector n) const;

};

class STriangle {

public:

int tag;

STriMeta meta;

union {

struct { Vector a, b, c; };

Vector vertices[3];

};

union {

struct { Vector an, bn, cn; };

Vector normals[3];

};

static STriangle From(STriMeta meta, Vector a, Vector b, Vector c);

Vector Normal() const;

void FlipNormal();

double MinAltitude() const;

bool ContainsPoint(Vector p) const;

bool ContainsPointProjd(Vector n, Vector p) const;

STriangle Transform(Vector o, Vector u, Vector v) const;

bool Raytrace(const Vector &rayPoint, const Vector &rayDir,

double *t, Vector *inters) const;

double SignedVolume() const;

double Area() const;

bool IsDegenerate() const;

};

class SBsp2 {

public:

Vector np; // normal to the plane

Vector no; // outer normal to the edge

double d;

SEdge edge;

SBsp2 *pos;

SBsp2 *neg;

SBsp2 *more;

void InsertTriangleHow(BspClass how, STriangle *tr, SMesh *m, SBsp3 *bsp3);

void InsertTriangle(STriangle *tr, SMesh *m, SBsp3 *bsp3);

Vector IntersectionWith(Vector a, Vector b) const;

void InsertEdge(SEdge *nedge, Vector nnp, Vector out);

static SBsp2 *InsertOrCreateEdge(SBsp2 *where, SEdge *nedge,

Vector nnp, Vector out);

static SBsp2 *Alloc();

};

class SBsp3 {

public:

Vector n;

double d;

STriangle tri;

SBsp3 *pos;

SBsp3 *neg;

SBsp3 *more;

SBsp2 *edges;

static SBsp3 *Alloc();

static SBsp3 *FromMesh(const SMesh *m);

Vector IntersectionWith(Vector a, Vector b) const;

void InsertHow(BspClass how, STriangle *str, SMesh *instead);

void Insert(STriangle *str, SMesh *instead);

static SBsp3 *InsertOrCreate(SBsp3 *where, STriangle *str, SMesh *instead);

void InsertConvexHow(BspClass how, STriMeta meta, Vector *vertex, size_t n,

SMesh *instead);

SBsp3 *InsertConvex(STriMeta meta, Vector *vertex, size_t n, SMesh *instead);

void InsertInPlane(bool pos2, STriangle *tr, SMesh *m);

void GenerateInPaintOrder(SMesh *m) const;

};

class SMesh {

public:

List<STriangle> l;

bool flipNormal;

bool keepInsideOtherShell;

bool keepCoplanar;

bool atLeastOneDiscarded;

bool isTransparent;

void Clear();

void AddTriangle(const STriangle *st);

void AddTriangle(STriMeta meta, Vector a, Vector b, Vector c);

void AddTriangle(STriMeta meta, Vector n,

Vector a, Vector b, Vector c);

void DoBounding(Vector v, Vector *vmax, Vector *vmin) const;

void GetBounding(Vector *vmax, Vector *vmin) const;

void Simplify(int start);

void AddAgainstBsp(SMesh *srcm, SBsp3 *bsp3);

void MakeFromUnionOf(SMesh *a, SMesh *b);

void MakeFromDifferenceOf(SMesh *a, SMesh *b);

void MakeFromIntersectionOf(SMesh *a, SMesh *b);

void MakeFromCopyOf(SMesh *a);

void MakeFromTransformationOf(SMesh *a, Vector trans,

Quaternion q, double scale);

void MakeFromAssemblyOf(SMesh *a, SMesh *b);

void MakeEdgesInPlaneInto(SEdgeList *sel, Vector n, double d);

void MakeOutlinesInto(SOutlineList *sol, EdgeKind type);

void PrecomputeTransparency();

void RemoveDegenerateTriangles();

double CalculateVolume() const;

double CalculateSurfaceArea(const std::vector<uint32_t> &faces) const;

bool IsEmpty() const;

void RemapFaces(Group *g, int remap);

uint32_t FirstIntersectionWith(Point2d mp) const;

Vector GetCenterOfMass() const;

};

// A linked list of triangles

class STriangleLl {

public:

STriangle *tri;

STriangleLl *next;

static STriangleLl *Alloc();

};

class SOutline {

public:

int tag;

Vector a, b, nl, nr;

bool IsVisible(Vector projDir) const;

};

class SOutlineList {

public:

List<SOutline> l;

void Clear();

void AddEdge(Vector a, Vector b, Vector nl, Vector nr, int tag = 0);

void ListTaggedInto(SEdgeList *el, int auxA = 0, int auxB = 0);

void MakeFromCopyOf(SOutlineList *ol);

};

class SKdNode {

public:

struct EdgeOnInfo {

int count;

bool frontFacing;

bool intersectsMesh;

STriangle *tr;

int ai;

int bi;

};

int which; // whether c is x, y, or z

double c;

SKdNode *gt;

SKdNode *lt;

STriangleLl *tris;

static SKdNode *Alloc();

static SKdNode *From(SMesh *m);

static SKdNode *From(STriangleLl *tll);

void AddTriangle(STriangle *tr);

void MakeMeshInto(SMesh *m) const;

void ListTrianglesInto(std::vector<STriangle *> *tl) const;

void ClearTags() const;

void FindEdgeOn(Vector a, Vector b, int cnt, bool coplanarIsInter, EdgeOnInfo *info) const;

void MakeCertainEdgesInto(SEdgeList *sel, EdgeKind how, bool coplanarIsInter,

bool *inter, bool *leaky, int auxA = 0) const;

void MakeOutlinesInto(SOutlineList *sel, EdgeKind tagKind) const;

void OcclusionTestLine(SEdge orig, SEdgeList *sel, int cnt) const;

void SplitLinesAgainstTriangle(SEdgeList *sel, STriangle *tr) const;

void SnapToMesh(SMesh *m);

void SnapToVertex(Vector v, SMesh *extras);

};

class PolylineBuilder {

public:

struct Edge;

struct Vertex {

Vector pos;

std::vector<Edge *> edges;

bool GetNext(uint32_t kind, Vertex **next, Edge **nextEdge);

bool GetNext(uint32_t kind, Vector plane, double d, Vertex **next, Edge **nextEdge);

size_t CountEdgesWithTagAndKind(int tag, uint32_t kind) const;

};

struct VertexPairHash {

size_t operator()(const std::pair<Vertex *, Vertex *> &v) const;

};

struct Edge {

Vertex *a;

Vertex *b;

uint32_t kind;

int tag;

union {

uintptr_t data;

SOutline *outline;

SEdge *edge;

};

Vertex *GetOtherVertex(Vertex *v) const;

bool GetStartAndNext(Vertex **start, Vertex **next, bool loop) const;

};

std::unordered_map<Vector, Vertex *, VectorHash, VectorPred> vertices;

std::unordered_map<std::pair<Vertex *, Vertex *>, Edge *, VertexPairHash> edgeMap;

std::vector<Edge *> edges;

~PolylineBuilder();

void Clear();

Vertex *AddVertex(const Vector &pos);

Edge *AddEdge(const Vector &p0, const Vector &p1, uint32_t kind, uintptr_t data = 0);

void Generate(std::function<void(Vertex *start, Vertex *next, Edge *edge)> const &startFunc,

std::function<void(Vertex *next, Edge *edge)> const &nextFunc,

std::function<void(Edge *)> const &aloneFunc,

std::function<void()> const &endFunc = []() {});

void MakeFromEdges(const SEdgeList &sel);

void MakeFromOutlines(const SOutlineList &sol);

void GenerateEdges(SEdgeList *sel);

void GenerateOutlines(SOutlineList *sol);

};

#endif