2009-07-08 09:44:13 +00:00
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
// The 2d vector output stuff that isn't specific to any particular file
|
|
|
|
// format: getting the appropriate lines and curves, performing hidden line
|
|
|
|
// removal, calculating bounding boxes, and so on. Also raster and triangle
|
|
|
|
// mesh output.
|
|
|
|
//-----------------------------------------------------------------------------
|
2008-07-08 07:45:47 +00:00
|
|
|
#include "solvespace.h"
|
|
|
|
#include <png.h>
|
|
|
|
|
2009-01-14 05:10:42 +00:00
|
|
|
void SolveSpace::ExportSectionTo(char *filename) {
|
2008-07-08 07:45:47 +00:00
|
|
|
Vector gn = (SS.GW.projRight).Cross(SS.GW.projUp);
|
|
|
|
gn = gn.WithMagnitude(1);
|
|
|
|
|
2009-04-19 05:53:16 +00:00
|
|
|
Group *g = SK.GetGroup(SS.GW.activeGroup);
|
2009-05-21 09:06:26 +00:00
|
|
|
g->GenerateDisplayItems();
|
2009-05-24 11:37:07 +00:00
|
|
|
if(g->displayMesh.IsEmpty()) {
|
2009-01-14 05:10:42 +00:00
|
|
|
Error("No solid model present; draw one with extrudes and revolves, "
|
|
|
|
"or use Export 2d View to export bare lines and curves.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2008-07-08 07:45:47 +00:00
|
|
|
// The plane in which the exported section lies; need this because we'll
|
|
|
|
// reorient from that plane into the xy plane before exporting.
|
2009-01-14 05:10:42 +00:00
|
|
|
Vector origin, u, v, n;
|
2008-07-08 07:45:47 +00:00
|
|
|
double d;
|
|
|
|
|
2009-01-14 05:10:42 +00:00
|
|
|
SS.GW.GroupSelection();
|
|
|
|
#define gs (SS.GW.gs)
|
|
|
|
if((gs.n == 0 && g->activeWorkplane.v != Entity::FREE_IN_3D.v)) {
|
2009-04-19 05:53:16 +00:00
|
|
|
Entity *wrkpl = SK.GetEntity(g->activeWorkplane);
|
2009-01-14 05:10:42 +00:00
|
|
|
origin = wrkpl->WorkplaneGetOffset();
|
|
|
|
n = wrkpl->Normal()->NormalN();
|
|
|
|
u = wrkpl->Normal()->NormalU();
|
|
|
|
v = wrkpl->Normal()->NormalV();
|
|
|
|
} else if(gs.n == 1 && gs.faces == 1) {
|
2009-04-19 05:53:16 +00:00
|
|
|
Entity *face = SK.GetEntity(gs.entity[0]);
|
2009-01-14 05:10:42 +00:00
|
|
|
origin = face->FaceGetPointNum();
|
|
|
|
n = face->FaceGetNormalNum();
|
2008-07-08 07:45:47 +00:00
|
|
|
if(n.Dot(gn) < 0) n = n.ScaledBy(-1);
|
|
|
|
u = n.Normal(0);
|
|
|
|
v = n.Normal(1);
|
2009-01-14 05:10:42 +00:00
|
|
|
} else if(gs.n == 3 && gs.vectors == 2 && gs.points == 1) {
|
2009-04-19 05:53:16 +00:00
|
|
|
Vector ut = SK.GetEntity(gs.entity[0])->VectorGetNum(),
|
|
|
|
vt = SK.GetEntity(gs.entity[1])->VectorGetNum();
|
2009-01-14 05:10:42 +00:00
|
|
|
ut = ut.WithMagnitude(1);
|
|
|
|
vt = vt.WithMagnitude(1);
|
|
|
|
|
|
|
|
if(fabs(SS.GW.projUp.Dot(vt)) < fabs(SS.GW.projUp.Dot(ut))) {
|
|
|
|
SWAP(Vector, ut, vt);
|
|
|
|
}
|
|
|
|
if(SS.GW.projRight.Dot(ut) < 0) ut = ut.ScaledBy(-1);
|
|
|
|
if(SS.GW.projUp. Dot(vt) < 0) vt = vt.ScaledBy(-1);
|
|
|
|
|
2009-04-19 05:53:16 +00:00
|
|
|
origin = SK.GetEntity(gs.point[0])->PointGetNum();
|
2009-01-14 05:10:42 +00:00
|
|
|
n = ut.Cross(vt);
|
|
|
|
u = ut.WithMagnitude(1);
|
|
|
|
v = (n.Cross(u)).WithMagnitude(1);
|
|
|
|
} else {
|
|
|
|
Error("Bad selection for export section. Please select:\r\n\r\n"
|
|
|
|
" * nothing, with an active workplane "
|
|
|
|
"(workplane is section plane)\r\n"
|
|
|
|
" * a face (section plane through face)\r\n"
|
|
|
|
" * a point and two line segments "
|
|
|
|
"(plane through point and parallel to lines)\r\n");
|
|
|
|
return;
|
2008-07-08 07:45:47 +00:00
|
|
|
}
|
2009-01-14 05:10:42 +00:00
|
|
|
SS.GW.ClearSelection();
|
2008-07-08 07:45:47 +00:00
|
|
|
|
2009-01-14 05:10:42 +00:00
|
|
|
n = n.WithMagnitude(1);
|
|
|
|
d = origin.Dot(n);
|
2008-07-08 07:45:47 +00:00
|
|
|
|
2009-01-14 05:10:42 +00:00
|
|
|
SEdgeList el;
|
|
|
|
ZERO(&el);
|
2009-04-14 04:19:23 +00:00
|
|
|
SBezierList bl;
|
|
|
|
ZERO(&bl);
|
|
|
|
|
2009-05-28 07:07:54 +00:00
|
|
|
// If there's a mesh, then grab the edges from it.
|
|
|
|
g->runningMesh.MakeEdgesInPlaneInto(&el, n, d);
|
|
|
|
|
|
|
|
// If there's a shell, then grab the edges and possibly Beziers.
|
2009-04-14 04:19:23 +00:00
|
|
|
g->runningShell.MakeSectionEdgesInto(n, d,
|
2009-04-16 04:42:51 +00:00
|
|
|
&el,
|
|
|
|
(SS.exportPwlCurves || fabs(SS.exportOffset) > LENGTH_EPS) ? NULL : &bl);
|
2009-04-14 04:19:23 +00:00
|
|
|
|
|
|
|
el.CullExtraneousEdges();
|
2009-04-15 02:55:18 +00:00
|
|
|
bl.CullIdenticalBeziers();
|
2009-01-14 05:10:42 +00:00
|
|
|
|
2009-03-17 16:33:46 +00:00
|
|
|
// And write the edges.
|
2009-01-14 05:10:42 +00:00
|
|
|
VectorFileWriter *out = VectorFileWriter::ForFile(filename);
|
|
|
|
if(out) {
|
2009-03-17 16:33:46 +00:00
|
|
|
// parallel projection (no perspective), and no mesh
|
2009-04-14 04:19:23 +00:00
|
|
|
ExportLinesAndMesh(&el, &bl, NULL,
|
2009-03-17 16:33:46 +00:00
|
|
|
u, v, n, origin, 0,
|
|
|
|
out);
|
2009-01-14 05:10:42 +00:00
|
|
|
}
|
2009-03-17 16:33:46 +00:00
|
|
|
el.Clear();
|
2009-04-14 04:19:23 +00:00
|
|
|
bl.Clear();
|
2009-01-14 05:10:42 +00:00
|
|
|
}
|
2008-07-08 07:45:47 +00:00
|
|
|
|
2009-01-14 05:10:42 +00:00
|
|
|
void SolveSpace::ExportViewTo(char *filename) {
|
|
|
|
int i;
|
|
|
|
SEdgeList edges;
|
|
|
|
ZERO(&edges);
|
2009-04-14 04:19:23 +00:00
|
|
|
SBezierList beziers;
|
|
|
|
ZERO(&beziers);
|
2008-07-08 07:45:47 +00:00
|
|
|
|
2009-03-17 16:33:46 +00:00
|
|
|
SMesh *sm = NULL;
|
|
|
|
if(SS.GW.showShaded) {
|
2009-05-21 09:06:26 +00:00
|
|
|
Group *g = SK.GetGroup(SS.GW.activeGroup);
|
|
|
|
g->GenerateDisplayItems();
|
|
|
|
sm = &(g->displayMesh);
|
2009-03-17 16:33:46 +00:00
|
|
|
}
|
2009-05-24 11:37:07 +00:00
|
|
|
if(sm->IsEmpty()) {
|
2009-04-15 02:55:18 +00:00
|
|
|
sm = NULL;
|
|
|
|
}
|
2008-07-08 07:45:47 +00:00
|
|
|
|
2009-04-19 05:53:16 +00:00
|
|
|
for(i = 0; i < SK.entity.n; i++) {
|
|
|
|
Entity *e = &(SK.entity.elem[i]);
|
2009-04-14 04:19:23 +00:00
|
|
|
if(!e->IsVisible()) continue;
|
2009-04-16 04:42:51 +00:00
|
|
|
if(e->construction) continue;
|
2009-04-14 04:19:23 +00:00
|
|
|
|
2009-04-16 04:42:51 +00:00
|
|
|
if(SS.exportPwlCurves || (sm && !SS.GW.showHdnLines) ||
|
|
|
|
fabs(SS.exportOffset) > LENGTH_EPS)
|
|
|
|
{
|
2009-04-14 04:19:23 +00:00
|
|
|
// We will be doing hidden line removal, which we can't do on
|
2009-04-16 04:42:51 +00:00
|
|
|
// exact curves; so we need things broken down to pwls. Same
|
|
|
|
// problem with cutter radius compensation.
|
2009-04-14 04:19:23 +00:00
|
|
|
e->GenerateEdges(&edges);
|
|
|
|
} else {
|
|
|
|
e->GenerateBezierCurves(&beziers);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-03-18 04:26:04 +00:00
|
|
|
if(SS.GW.showEdges) {
|
2009-05-21 09:06:26 +00:00
|
|
|
Group *g = SK.GetGroup(SS.GW.activeGroup);
|
|
|
|
g->GenerateDisplayItems();
|
|
|
|
SEdgeList *selr = &(g->displayEdges);
|
2009-03-18 04:26:04 +00:00
|
|
|
SEdge *se;
|
2009-03-29 06:05:28 +00:00
|
|
|
for(se = selr->l.First(); se; se = selr->l.NextAfter(se)) {
|
2009-03-18 04:26:04 +00:00
|
|
|
edges.AddEdge(se->a, se->b);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-07-03 20:55:57 +00:00
|
|
|
if(SS.GW.showConstraints) {
|
|
|
|
Constraint *c;
|
|
|
|
for(c = SK.constraint.First(); c; c = SK.constraint.NextAfter(c)) {
|
|
|
|
c->GetEdges(&edges);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-01-14 05:10:42 +00:00
|
|
|
Vector u = SS.GW.projRight,
|
|
|
|
v = SS.GW.projUp,
|
|
|
|
n = u.Cross(v),
|
|
|
|
origin = SS.GW.offset.ScaledBy(-1);
|
2008-07-08 07:45:47 +00:00
|
|
|
|
2009-01-14 05:10:42 +00:00
|
|
|
VectorFileWriter *out = VectorFileWriter::ForFile(filename);
|
|
|
|
if(out) {
|
2009-04-14 04:19:23 +00:00
|
|
|
ExportLinesAndMesh(&edges, &beziers, sm,
|
2009-03-17 16:33:46 +00:00
|
|
|
u, v, n, origin, SS.cameraTangent*SS.GW.scale,
|
|
|
|
out);
|
2009-01-14 05:10:42 +00:00
|
|
|
}
|
|
|
|
edges.Clear();
|
2009-04-14 04:19:23 +00:00
|
|
|
beziers.Clear();
|
2009-01-14 05:10:42 +00:00
|
|
|
}
|
2008-07-08 07:45:47 +00:00
|
|
|
|
2009-04-14 04:19:23 +00:00
|
|
|
void SolveSpace::ExportLinesAndMesh(SEdgeList *sel, SBezierList *sbl, SMesh *sm,
|
2009-03-17 16:33:46 +00:00
|
|
|
Vector u, Vector v, Vector n,
|
|
|
|
Vector origin, double cameraTan,
|
|
|
|
VectorFileWriter *out)
|
2009-01-14 05:10:42 +00:00
|
|
|
{
|
2009-03-17 16:33:46 +00:00
|
|
|
double s = 1.0 / SS.exportScale;
|
|
|
|
|
2008-08-14 08:28:25 +00:00
|
|
|
// Project into the export plane; so when we're done, z doesn't matter,
|
|
|
|
// and x and y are what goes in the DXF.
|
2009-03-17 16:33:46 +00:00
|
|
|
SEdge *e;
|
|
|
|
for(e = sel->l.First(); e; e = sel->l.NextAfter(e)) {
|
|
|
|
// project into the specified csys, and apply export scale
|
|
|
|
(e->a) = e->a.InPerspective(u, v, n, origin, cameraTan).ScaledBy(s);
|
|
|
|
(e->b) = e->b.InPerspective(u, v, n, origin, cameraTan).ScaledBy(s);
|
2008-08-14 08:28:25 +00:00
|
|
|
}
|
|
|
|
|
2009-04-14 04:19:23 +00:00
|
|
|
SBezier *b;
|
|
|
|
if(sbl) {
|
|
|
|
for(b = sbl->l.First(); b; b = sbl->l.NextAfter(b)) {
|
|
|
|
*b = b->InPerspective(u, v, n, origin, cameraTan);
|
|
|
|
int i;
|
|
|
|
for(i = 0; i <= b->deg; i++) {
|
|
|
|
b->ctrl[i] = (b->ctrl[i]).ScaledBy(s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-03-17 16:33:46 +00:00
|
|
|
// If cutter radius compensation is requested, then perform it now
|
2008-08-14 08:28:25 +00:00
|
|
|
if(fabs(SS.exportOffset) > LENGTH_EPS) {
|
2009-03-17 16:33:46 +00:00
|
|
|
// assemble those edges into a polygon, and clear the edge list
|
|
|
|
SPolygon sp;
|
|
|
|
ZERO(&sp);
|
|
|
|
sel->AssemblePolygon(&sp, NULL);
|
|
|
|
sel->Clear();
|
|
|
|
|
2008-08-14 08:28:25 +00:00
|
|
|
SPolygon compd;
|
|
|
|
ZERO(&compd);
|
2009-03-17 16:33:46 +00:00
|
|
|
sp.normal = Vector::From(0, 0, -1);
|
|
|
|
sp.FixContourDirections();
|
2009-09-03 08:13:09 +00:00
|
|
|
sp.OffsetInto(&compd, SS.exportOffset*s);
|
2009-03-17 16:33:46 +00:00
|
|
|
sp.Clear();
|
|
|
|
|
|
|
|
compd.MakeEdgesInto(sel);
|
|
|
|
compd.Clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now the triangle mesh; project, then build a BSP to perform
|
|
|
|
// occlusion testing and generated the shaded surfaces.
|
|
|
|
SMesh smp;
|
|
|
|
ZERO(&smp);
|
|
|
|
if(sm) {
|
|
|
|
Vector l0 = (SS.lightDir[0]).WithMagnitude(1),
|
|
|
|
l1 = (SS.lightDir[1]).WithMagnitude(1);
|
|
|
|
STriangle *tr;
|
|
|
|
for(tr = sm->l.First(); tr; tr = sm->l.NextAfter(tr)) {
|
|
|
|
STriangle tt = *tr;
|
|
|
|
tt.a = (tt.a).InPerspective(u, v, n, origin, cameraTan).ScaledBy(s);
|
|
|
|
tt.b = (tt.b).InPerspective(u, v, n, origin, cameraTan).ScaledBy(s);
|
|
|
|
tt.c = (tt.c).InPerspective(u, v, n, origin, cameraTan).ScaledBy(s);
|
|
|
|
|
|
|
|
// And calculate lighting for the triangle
|
|
|
|
Vector n = tt.Normal().WithMagnitude(1);
|
|
|
|
double lighting = SS.ambientIntensity +
|
|
|
|
max(0, (SS.lightIntensity[0])*(n.Dot(l0))) +
|
|
|
|
max(0, (SS.lightIntensity[1])*(n.Dot(l1)));
|
|
|
|
double r = min(1, REDf (tt.meta.color)*lighting),
|
|
|
|
g = min(1, GREENf(tt.meta.color)*lighting),
|
|
|
|
b = min(1, BLUEf (tt.meta.color)*lighting);
|
|
|
|
tt.meta.color = RGBf(r, g, b);
|
|
|
|
smp.AddTriangle(&tt);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Use the BSP routines to generate the split triangles in paint order.
|
|
|
|
SBsp3 *bsp = SBsp3::FromMesh(&smp);
|
|
|
|
SMesh sms;
|
|
|
|
ZERO(&sms);
|
|
|
|
bsp->GenerateInPaintOrder(&sms);
|
|
|
|
// And cull the back-facing triangles
|
|
|
|
STriangle *tr;
|
|
|
|
sms.l.ClearTags();
|
|
|
|
for(tr = sms.l.First(); tr; tr = sms.l.NextAfter(tr)) {
|
|
|
|
Vector n = tr->Normal();
|
|
|
|
if(n.z < 0) {
|
|
|
|
tr->tag = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
sms.l.RemoveTagged();
|
|
|
|
|
|
|
|
// And now we perform hidden line removal if requested
|
|
|
|
SEdgeList hlrd;
|
|
|
|
ZERO(&hlrd);
|
|
|
|
if(sm && !SS.GW.showHdnLines) {
|
|
|
|
SKdNode *root = SKdNode::From(&smp);
|
2009-03-18 04:26:04 +00:00
|
|
|
|
|
|
|
// Generate the edges where a curved surface turns from front-facing
|
|
|
|
// to back-facing.
|
|
|
|
if(SS.GW.showEdges) {
|
2009-05-29 05:40:17 +00:00
|
|
|
root->MakeCertainEdgesInto(sel, SKdNode::TURNING_EDGES,
|
|
|
|
false, NULL, NULL);
|
2009-03-18 04:26:04 +00:00
|
|
|
}
|
|
|
|
|
2009-03-17 16:33:46 +00:00
|
|
|
root->ClearTags();
|
|
|
|
int cnt = 1234;
|
|
|
|
|
|
|
|
SEdge *se;
|
|
|
|
for(se = sel->l.First(); se; se = sel->l.NextAfter(se)) {
|
|
|
|
SEdgeList out;
|
|
|
|
ZERO(&out);
|
|
|
|
// Split the original edge against the mesh
|
|
|
|
out.AddEdge(se->a, se->b);
|
|
|
|
root->OcclusionTestLine(*se, &out, cnt);
|
2009-04-08 04:54:07 +00:00
|
|
|
// the occlusion test splits unnecessarily; so fix those
|
|
|
|
out.MergeCollinearSegments(se->a, se->b);
|
2009-03-17 16:33:46 +00:00
|
|
|
cnt++;
|
|
|
|
// And add the results to our output
|
|
|
|
SEdge *sen;
|
|
|
|
for(sen = out.l.First(); sen; sen = out.l.NextAfter(sen)) {
|
|
|
|
hlrd.AddEdge(sen->a, sen->b);
|
|
|
|
}
|
|
|
|
out.Clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
sel = &hlrd;
|
2009-01-14 05:10:42 +00:00
|
|
|
}
|
|
|
|
|
2009-03-17 16:33:46 +00:00
|
|
|
// Now write the lines and triangles to the output file
|
2009-04-14 04:19:23 +00:00
|
|
|
out->Output(sel, sbl, &sms);
|
2009-03-17 16:33:46 +00:00
|
|
|
|
|
|
|
smp.Clear();
|
|
|
|
sms.Clear();
|
|
|
|
hlrd.Clear();
|
2009-01-14 05:10:42 +00:00
|
|
|
}
|
|
|
|
|
2009-04-15 06:50:06 +00:00
|
|
|
double VectorFileWriter::MmToPts(double mm) {
|
|
|
|
// 72 points in an inch
|
|
|
|
return (mm/25.4)*72;
|
|
|
|
}
|
|
|
|
|
2009-01-14 05:10:42 +00:00
|
|
|
bool VectorFileWriter::StringEndsIn(char *str, char *ending) {
|
|
|
|
int i, ls = strlen(str), le = strlen(ending);
|
|
|
|
|
|
|
|
if(ls < le) return false;
|
|
|
|
|
|
|
|
for(i = 0; i < le; i++) {
|
|
|
|
if(tolower(ending[le-i-1]) != tolower(str[ls-i-1])) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
VectorFileWriter *VectorFileWriter::ForFile(char *filename) {
|
|
|
|
VectorFileWriter *ret;
|
|
|
|
if(StringEndsIn(filename, ".dxf")) {
|
|
|
|
static DxfFileWriter DxfWriter;
|
|
|
|
ret = &DxfWriter;
|
2009-01-27 05:48:40 +00:00
|
|
|
} else if(StringEndsIn(filename, ".ps") || StringEndsIn(filename, ".eps")) {
|
|
|
|
static EpsFileWriter EpsWriter;
|
|
|
|
ret = &EpsWriter;
|
2009-04-15 06:50:06 +00:00
|
|
|
} else if(StringEndsIn(filename, ".pdf")) {
|
|
|
|
static PdfFileWriter PdfWriter;
|
|
|
|
ret = &PdfWriter;
|
2009-01-27 05:48:40 +00:00
|
|
|
} else if(StringEndsIn(filename, ".svg")) {
|
|
|
|
static SvgFileWriter SvgWriter;
|
|
|
|
ret = &SvgWriter;
|
|
|
|
} else if(StringEndsIn(filename, ".plt")||StringEndsIn(filename, ".hpgl")) {
|
|
|
|
static HpglFileWriter HpglWriter;
|
|
|
|
ret = &HpglWriter;
|
2009-06-11 05:57:23 +00:00
|
|
|
} else if(StringEndsIn(filename, ".step")||StringEndsIn(filename, ".stp")) {
|
|
|
|
static Step2dFileWriter Step2dWriter;
|
|
|
|
ret = &Step2dWriter;
|
2009-01-14 05:10:42 +00:00
|
|
|
} else {
|
2009-01-27 05:48:40 +00:00
|
|
|
Error("Can't identify output file type from file extension of "
|
2009-06-11 05:57:23 +00:00
|
|
|
"filename '%s'; try .step, .stp, .dxf, .svg, .plt, .hpgl, .pdf, "
|
|
|
|
".eps, or .ps.",
|
2009-04-15 06:50:06 +00:00
|
|
|
filename);
|
2009-01-14 05:10:42 +00:00
|
|
|
return NULL;
|
2008-08-14 08:28:25 +00:00
|
|
|
}
|
|
|
|
|
2008-07-08 07:45:47 +00:00
|
|
|
FILE *f = fopen(filename, "wb");
|
|
|
|
if(!f) {
|
|
|
|
Error("Couldn't write to '%s'", filename);
|
2009-01-14 05:10:42 +00:00
|
|
|
return NULL;
|
2008-07-08 07:45:47 +00:00
|
|
|
}
|
2009-01-14 05:10:42 +00:00
|
|
|
ret->f = f;
|
|
|
|
return ret;
|
|
|
|
}
|
2008-07-08 07:45:47 +00:00
|
|
|
|
2009-04-14 04:19:23 +00:00
|
|
|
void VectorFileWriter::Output(SEdgeList *sel, SBezierList *sbl, SMesh *sm) {
|
2009-03-17 16:33:46 +00:00
|
|
|
STriangle *tr;
|
|
|
|
SEdge *e;
|
2009-04-14 04:19:23 +00:00
|
|
|
SBezier *b;
|
2009-01-27 05:48:40 +00:00
|
|
|
|
|
|
|
// First calculate the bounding box.
|
|
|
|
ptMin = Vector::From(VERY_POSITIVE, VERY_POSITIVE, VERY_POSITIVE);
|
|
|
|
ptMax = Vector::From(VERY_NEGATIVE, VERY_NEGATIVE, VERY_NEGATIVE);
|
2009-03-17 16:33:46 +00:00
|
|
|
if(sel) {
|
|
|
|
for(e = sel->l.First(); e; e = sel->l.NextAfter(e)) {
|
|
|
|
(e->a).MakeMaxMin(&ptMax, &ptMin);
|
|
|
|
(e->b).MakeMaxMin(&ptMax, &ptMin);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(sm) {
|
|
|
|
for(tr = sm->l.First(); tr; tr = sm->l.NextAfter(tr)) {
|
|
|
|
(tr->a).MakeMaxMin(&ptMax, &ptMin);
|
|
|
|
(tr->b).MakeMaxMin(&ptMax, &ptMin);
|
|
|
|
(tr->c).MakeMaxMin(&ptMax, &ptMin);
|
2009-01-27 05:48:40 +00:00
|
|
|
}
|
|
|
|
}
|
2009-04-14 04:19:23 +00:00
|
|
|
if(sbl) {
|
|
|
|
for(b = sbl->l.First(); b; b = sbl->l.NextAfter(b)) {
|
|
|
|
int i;
|
|
|
|
for(i = 0; i <= b->deg; i++) {
|
|
|
|
(b->ctrl[i]).MakeMaxMin(&ptMax, &ptMin);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-01-27 05:48:40 +00:00
|
|
|
|
2009-09-03 08:13:09 +00:00
|
|
|
// And now we compute the canvas size.
|
|
|
|
double s = 1.0 / SS.exportScale;
|
|
|
|
if(SS.exportCanvasSizeAuto) {
|
|
|
|
// It's based on the calculated bounding box; we grow it along each
|
|
|
|
// boundary by the specified amount.
|
|
|
|
ptMin.x -= s*SS.exportMargin.left;
|
|
|
|
ptMax.x += s*SS.exportMargin.right;
|
|
|
|
ptMin.y -= s*SS.exportMargin.bottom;
|
|
|
|
ptMax.y += s*SS.exportMargin.top;
|
|
|
|
} else {
|
|
|
|
ptMin.x = -(s*SS.exportCanvas.dx);
|
|
|
|
ptMin.y = -(s*SS.exportCanvas.dy);
|
|
|
|
ptMax.x = ptMin.x + (s*SS.exportCanvas.width);
|
|
|
|
ptMax.y = ptMin.y + (s*SS.exportCanvas.height);
|
|
|
|
}
|
|
|
|
|
2009-01-27 05:48:40 +00:00
|
|
|
StartFile();
|
2009-03-18 04:26:04 +00:00
|
|
|
if(sm && SS.exportShadedTriangles) {
|
2009-03-17 16:33:46 +00:00
|
|
|
for(tr = sm->l.First(); tr; tr = sm->l.NextAfter(tr)) {
|
|
|
|
Triangle(tr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(sel) {
|
|
|
|
for(e = sel->l.First(); e; e = sel->l.NextAfter(e)) {
|
|
|
|
LineSegment(e->a.x, e->a.y, e->b.x, e->b.y);
|
2009-01-27 05:48:40 +00:00
|
|
|
}
|
|
|
|
}
|
2009-04-14 04:19:23 +00:00
|
|
|
if(sbl) {
|
|
|
|
for(b = sbl->l.First(); b; b = sbl->l.NextAfter(b)) {
|
|
|
|
Bezier(b);
|
|
|
|
}
|
|
|
|
}
|
2009-01-27 05:48:40 +00:00
|
|
|
FinishAndCloseFile();
|
|
|
|
}
|
|
|
|
|
2009-04-14 04:19:23 +00:00
|
|
|
void VectorFileWriter::BezierAsPwl(SBezier *sb) {
|
|
|
|
List<Vector> lv;
|
|
|
|
ZERO(&lv);
|
|
|
|
sb->MakePwlInto(&lv);
|
|
|
|
int i;
|
|
|
|
for(i = 1; i < lv.n; i++) {
|
|
|
|
LineSegment(lv.elem[i-1].x, lv.elem[i-1].y,
|
|
|
|
lv.elem[i ].x, lv.elem[i ].y);
|
|
|
|
}
|
|
|
|
lv.Clear();
|
|
|
|
}
|
|
|
|
|
2009-04-15 06:50:06 +00:00
|
|
|
void VectorFileWriter::BezierAsNonrationalCubic(SBezier *sb, int depth) {
|
|
|
|
Vector t0 = sb->TangentAt(0), t1 = sb->TangentAt(1);
|
|
|
|
// The curve is correct, and the first derivatives are correct, at the
|
|
|
|
// endpoints.
|
|
|
|
SBezier bnr = SBezier::From(
|
|
|
|
sb->Start(),
|
|
|
|
sb->Start().Plus(t0.ScaledBy(1.0/3)),
|
|
|
|
sb->Finish().Minus(t1.ScaledBy(1.0/3)),
|
|
|
|
sb->Finish());
|
|
|
|
|
|
|
|
double tol = SS.ChordTolMm() / SS.exportScale;
|
|
|
|
// Arbitrary choice, but make it a little finer than pwl tolerance since
|
|
|
|
// it should be easier to achieve that with the smooth curves.
|
|
|
|
tol /= 2;
|
|
|
|
|
|
|
|
bool closeEnough = true;
|
|
|
|
int i;
|
|
|
|
for(i = 1; i <= 3; i++) {
|
|
|
|
double t = i/4.0;
|
|
|
|
Vector p0 = sb->PointAt(t),
|
|
|
|
pn = bnr.PointAt(t);
|
|
|
|
double d = (p0.Minus(pn)).Magnitude();
|
|
|
|
if(d > tol) {
|
|
|
|
closeEnough = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(closeEnough || depth > 3) {
|
|
|
|
Bezier(&bnr);
|
|
|
|
} else {
|
|
|
|
SBezier bef, aft;
|
|
|
|
sb->SplitAt(0.5, &bef, &aft);
|
|
|
|
BezierAsNonrationalCubic(&bef, depth+1);
|
|
|
|
BezierAsNonrationalCubic(&aft, depth+1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-01-27 05:48:40 +00:00
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
// Export the mesh as an STL file; it should always be vertex-to-vertex and
|
|
|
|
// not self-intersecting, so not much to do.
|
|
|
|
//-----------------------------------------------------------------------------
|
2008-07-08 07:45:47 +00:00
|
|
|
void SolveSpace::ExportMeshTo(char *filename) {
|
2009-05-21 09:06:26 +00:00
|
|
|
SMesh *m = &(SK.GetGroup(SS.GW.activeGroup)->displayMesh);
|
2009-05-24 11:37:07 +00:00
|
|
|
if(m->IsEmpty()) {
|
2008-07-08 07:45:47 +00:00
|
|
|
Error("Active group mesh is empty; nothing to export.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
FILE *f = fopen(filename, "wb");
|
|
|
|
if(!f) {
|
|
|
|
Error("Couldn't write to '%s'", filename);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
char str[80];
|
|
|
|
memset(str, 0, sizeof(str));
|
|
|
|
strcpy(str, "STL exported mesh");
|
|
|
|
fwrite(str, 1, 80, f);
|
|
|
|
|
2009-01-23 03:30:30 +00:00
|
|
|
DWORD n = m->l.n;
|
2008-07-08 07:45:47 +00:00
|
|
|
fwrite(&n, 4, 1, f);
|
|
|
|
|
|
|
|
double s = SS.exportScale;
|
|
|
|
int i;
|
2009-01-23 03:30:30 +00:00
|
|
|
for(i = 0; i < m->l.n; i++) {
|
|
|
|
STriangle *tr = &(m->l.elem[i]);
|
2008-07-08 07:45:47 +00:00
|
|
|
Vector n = tr->Normal().WithMagnitude(1);
|
|
|
|
float w;
|
|
|
|
w = (float)n.x; fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)n.y; fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)n.z; fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->a.x)/s); fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->a.y)/s); fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->a.z)/s); fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->b.x)/s); fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->b.y)/s); fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->b.z)/s); fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->c.x)/s); fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->c.y)/s); fwrite(&w, 4, 1, f);
|
|
|
|
w = (float)((tr->c.z)/s); fwrite(&w, 4, 1, f);
|
|
|
|
fputc(0, f);
|
|
|
|
fputc(0, f);
|
|
|
|
}
|
|
|
|
|
|
|
|
fclose(f);
|
|
|
|
}
|
|
|
|
|
2009-01-27 05:48:40 +00:00
|
|
|
//-----------------------------------------------------------------------------
|
|
|
|
// Export a view of the model as an image; we just take a screenshot, by
|
|
|
|
// rendering the view in the usual way and then copying the pixels.
|
|
|
|
//-----------------------------------------------------------------------------
|
2008-07-08 07:45:47 +00:00
|
|
|
void SolveSpace::ExportAsPngTo(char *filename) {
|
|
|
|
int w = (int)SS.GW.width, h = (int)SS.GW.height;
|
|
|
|
// No guarantee that the back buffer contains anything valid right now,
|
2009-01-14 05:10:42 +00:00
|
|
|
// so repaint the scene. And hide the toolbar too.
|
|
|
|
int prevShowToolbar = SS.showToolbar;
|
|
|
|
SS.showToolbar = false;
|
2008-07-08 07:45:47 +00:00
|
|
|
SS.GW.Paint(w, h);
|
2009-01-14 05:10:42 +00:00
|
|
|
SS.showToolbar = prevShowToolbar;
|
2008-07-08 07:45:47 +00:00
|
|
|
|
|
|
|
FILE *f = fopen(filename, "wb");
|
|
|
|
if(!f) goto err;
|
|
|
|
|
|
|
|
png_struct *png_ptr = png_create_write_struct(PNG_LIBPNG_VER_STRING,
|
|
|
|
NULL, NULL, NULL);
|
|
|
|
if(!png_ptr) goto err;
|
|
|
|
|
|
|
|
png_info *info_ptr = png_create_info_struct(png_ptr);
|
|
|
|
if(!png_ptr) goto err;
|
|
|
|
|
|
|
|
if(setjmp(png_jmpbuf(png_ptr))) goto err;
|
|
|
|
|
|
|
|
png_init_io(png_ptr, f);
|
|
|
|
|
|
|
|
// glReadPixels wants to align things on 4-boundaries, and there's 3
|
|
|
|
// bytes per pixel. As long as the row width is divisible by 4, all
|
|
|
|
// works out.
|
|
|
|
w &= ~3; h &= ~3;
|
|
|
|
|
|
|
|
png_set_IHDR(png_ptr, info_ptr, w, h,
|
|
|
|
8, PNG_COLOR_TYPE_RGB, PNG_INTERLACE_NONE,
|
|
|
|
PNG_COMPRESSION_TYPE_DEFAULT,PNG_FILTER_TYPE_DEFAULT);
|
|
|
|
|
|
|
|
png_write_info(png_ptr, info_ptr);
|
|
|
|
|
|
|
|
// Get the pixel data from the framebuffer
|
|
|
|
BYTE *pixels = (BYTE *)AllocTemporary(3*w*h);
|
|
|
|
BYTE **rowptrs = (BYTE **)AllocTemporary(h*sizeof(BYTE *));
|
|
|
|
glReadPixels(0, 0, w, h, GL_RGB, GL_UNSIGNED_BYTE, pixels);
|
|
|
|
|
|
|
|
int y;
|
|
|
|
for(y = 0; y < h; y++) {
|
|
|
|
// gl puts the origin at lower left, but png puts it top left
|
|
|
|
rowptrs[y] = pixels + ((h - 1) - y)*(3*w);
|
|
|
|
}
|
|
|
|
png_write_image(png_ptr, rowptrs);
|
|
|
|
|
|
|
|
png_write_end(png_ptr, info_ptr);
|
|
|
|
png_destroy_write_struct(&png_ptr, &info_ptr);
|
2008-07-21 01:34:09 +00:00
|
|
|
fclose(f);
|
2008-07-08 07:45:47 +00:00
|
|
|
return;
|
|
|
|
|
|
|
|
err:
|
|
|
|
Error("Error writing PNG file '%s'", filename);
|
|
|
|
if(f) fclose(f);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|