dxfngc

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
/* drawing (DXF) to G-code (NGC) converter
 * Copyright 2013 Stefan Schuermans <stefan@schuermans.info>
 * Copyleft: CC-BY-SA http://creativecommons.org/licenses/by-sa/3.0/
 */
#include <dime/entities/Entity.h>
#include <dime/State.h>
#include <string>
#include "drawing.h"
#include "layer.h"
#include "path.h"
#include "traverse.h"
/**
 * @brief process an entity during DXF traversal
 * @param[in] state current state of libdime
 * @param[in] entity pointer to entity
 * @param[in] vp_ctx context pointer, must point to traverse_ctx structure
 * @return if to continue enumeration
 */
bool traverse_entity(const class dimeState * const state, dimeEntity *entity,
                     void *vp_ctx)
{
  struct traverse_ctx *p_ctx = (struct traverse_ctx *)vp_ctx;
  // get layer
  std::string strLayerName = entity->getLayerName();
  Layer &layer = p_ctx->mpDrawing->mLayers[strLayerName];
  // get transformation matrix
  dimeMatrix matrix;
  state->getMatrix(matrix);
  // get geometry data
  dimeArray<dimeVec3f> vertices;
  dimeArray<int> indices;
  dimeVec3f extrusionDir;
  dxfdouble thickness;
  entity->extractGeometry(vertices, indices, extrusionDir, thickness);
  // transform geometry data
  for (int v = 0; v < vertices.count(); ++v)
    matrix.multMatrixVec(vertices[v]);
  // no indices -> entire vertices array forms a path
  if (indices.count() == 0) {
    Path &path = layer.addPath();
    for (int v = 0; v < vertices.count(); ++v)
      path.addPoint(vertices[v].x, vertices[v].y);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX