2010-02-20 17:37:20 +03:00
|
|
|
/*
|
2011-01-21 04:21:09 +03:00
|
|
|
* OpenSCAD (www.openscad.org)
|
|
|
|
* Copyright (C) 2009-2011 Clifford Wolf <clifford@clifford.at> and
|
|
|
|
* Marius Kintel <marius@kintel.net>
|
2010-02-20 17:37:20 +03:00
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* As a special exception, you have permission to link this program
|
|
|
|
* with the CGAL library and distribute executables, as long as you
|
|
|
|
* follow the requirements of the GNU GPL in regard to all of the
|
|
|
|
* software in the executable aside from CGAL.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "module.h"
|
|
|
|
#include "node.h"
|
|
|
|
#include "context.h"
|
|
|
|
#include "builtin.h"
|
|
|
|
#include "printutils.h"
|
|
|
|
#include "cgal.h"
|
2010-03-02 21:22:31 +03:00
|
|
|
#include "visitor.h"
|
|
|
|
#include <sstream>
|
2010-03-28 19:57:39 +04:00
|
|
|
#include <assert.h>
|
2010-02-20 17:37:20 +03:00
|
|
|
|
2010-02-28 21:22:28 +03:00
|
|
|
#ifdef ENABLE_CGAL
|
2010-03-03 22:27:22 +03:00
|
|
|
extern CGAL_Nef_polyhedron3 minkowski3(CGAL_Nef_polyhedron3 a, CGAL_Nef_polyhedron3 b);
|
|
|
|
extern CGAL_Nef_polyhedron2 minkowski2(CGAL_Nef_polyhedron2 a, CGAL_Nef_polyhedron2 b);
|
2011-04-09 23:27:08 +04:00
|
|
|
extern CGAL_Nef_polyhedron2 convexhull2(std::list<CGAL_Nef_polyhedron2> a);
|
2010-02-28 21:22:28 +03:00
|
|
|
#endif
|
2010-02-20 17:37:20 +03:00
|
|
|
|
|
|
|
enum cgaladv_type_e {
|
|
|
|
MINKOWSKI,
|
|
|
|
GLIDE,
|
2011-04-09 01:19:06 +04:00
|
|
|
SUBDIV,
|
|
|
|
HULL
|
2010-02-20 17:37:20 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
class CgaladvModule : public AbstractModule
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
cgaladv_type_e type;
|
|
|
|
CgaladvModule(cgaladv_type_e type) : type(type) { }
|
|
|
|
virtual AbstractNode *evaluate(const Context *ctx, const ModuleInstantiation *inst) const;
|
|
|
|
};
|
|
|
|
|
|
|
|
class CgaladvNode : public AbstractNode
|
|
|
|
{
|
|
|
|
public:
|
2010-03-02 21:22:31 +03:00
|
|
|
CgaladvNode(const ModuleInstantiation *mi, cgaladv_type_e type) : AbstractNode(mi), type(type) {
|
|
|
|
convexity = 1;
|
|
|
|
}
|
|
|
|
virtual ~CgaladvNode() { }
|
2010-08-28 19:34:22 +04:00
|
|
|
virtual Response accept(class State &state, Visitor &visitor) const {
|
2010-03-02 21:22:31 +03:00
|
|
|
return visitor.visit(state, *this);
|
|
|
|
}
|
|
|
|
virtual std::string toString() const;
|
2010-08-28 23:21:44 +04:00
|
|
|
virtual std::string name() const {
|
|
|
|
switch (this->type) {
|
|
|
|
case MINKOWSKI:
|
|
|
|
return "minkowski";
|
|
|
|
break;
|
|
|
|
case GLIDE:
|
|
|
|
return "glide";
|
|
|
|
break;
|
|
|
|
case SUBDIV:
|
|
|
|
return "subdiv";
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
}
|
2010-03-02 21:22:31 +03:00
|
|
|
|
2010-02-20 17:37:20 +03:00
|
|
|
Value path;
|
2010-11-08 00:29:34 +03:00
|
|
|
std::string subdiv_type;
|
2010-02-20 17:37:20 +03:00
|
|
|
int convexity, level;
|
|
|
|
cgaladv_type_e type;
|
|
|
|
};
|
|
|
|
|
|
|
|
AbstractNode *CgaladvModule::evaluate(const Context *ctx, const ModuleInstantiation *inst) const
|
|
|
|
{
|
|
|
|
CgaladvNode *node = new CgaladvNode(inst, type);
|
|
|
|
|
|
|
|
QVector<QString> argnames;
|
|
|
|
QVector<Expression*> argexpr;
|
|
|
|
|
|
|
|
if (type == MINKOWSKI)
|
|
|
|
argnames = QVector<QString>() << "convexity";
|
|
|
|
|
|
|
|
if (type == GLIDE)
|
|
|
|
argnames = QVector<QString>() << "path" << "convexity";
|
|
|
|
|
|
|
|
if (type == SUBDIV)
|
|
|
|
argnames = QVector<QString>() << "type" << "level" << "convexity";
|
|
|
|
|
|
|
|
Context c(ctx);
|
|
|
|
c.args(argnames, argexpr, inst->argnames, inst->argvalues);
|
|
|
|
|
|
|
|
Value convexity, path, subdiv_type, level;
|
|
|
|
|
|
|
|
if (type == MINKOWSKI) {
|
|
|
|
convexity = c.lookup_variable("convexity", true);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (type == GLIDE) {
|
|
|
|
convexity = c.lookup_variable("convexity", true);
|
|
|
|
path = c.lookup_variable("path", false);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (type == SUBDIV) {
|
|
|
|
convexity = c.lookup_variable("convexity", true);
|
|
|
|
subdiv_type = c.lookup_variable("type", false);
|
|
|
|
level = c.lookup_variable("level", true);
|
|
|
|
}
|
|
|
|
|
|
|
|
node->convexity = (int)convexity.num;
|
|
|
|
node->path = path;
|
|
|
|
node->subdiv_type = subdiv_type.text;
|
|
|
|
node->level = (int)level.num;
|
|
|
|
|
|
|
|
if (node->level <= 1)
|
|
|
|
node->level = 1;
|
|
|
|
|
|
|
|
foreach (ModuleInstantiation *v, inst->children) {
|
|
|
|
AbstractNode *n = v->evaluate(inst->ctx);
|
|
|
|
if (n)
|
|
|
|
node->children.append(n);
|
|
|
|
}
|
|
|
|
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
|
|
|
void register_builtin_cgaladv()
|
|
|
|
{
|
|
|
|
builtin_modules["minkowski"] = new CgaladvModule(MINKOWSKI);
|
|
|
|
builtin_modules["glide"] = new CgaladvModule(GLIDE);
|
|
|
|
builtin_modules["subdiv"] = new CgaladvModule(SUBDIV);
|
2011-04-09 01:19:06 +04:00
|
|
|
builtin_modules["hull"] = new CgaladvModule(HULL);
|
2010-02-20 17:37:20 +03:00
|
|
|
}
|
|
|
|
|
2010-03-02 21:22:31 +03:00
|
|
|
std::string CgaladvNode::toString() const
|
|
|
|
{
|
|
|
|
std::stringstream stream;
|
|
|
|
|
2010-08-28 23:21:44 +04:00
|
|
|
stream << this->name();
|
2010-03-02 21:22:31 +03:00
|
|
|
switch (type) {
|
|
|
|
case MINKOWSKI:
|
2010-08-28 23:21:44 +04:00
|
|
|
stream << "(convexity = " << this->convexity << ")";
|
2010-03-02 21:22:31 +03:00
|
|
|
break;
|
|
|
|
case GLIDE:
|
2010-11-08 00:29:34 +03:00
|
|
|
stream << "(path = " << this->path << ", convexity = " << this->convexity << ")";
|
2010-03-02 21:22:31 +03:00
|
|
|
break;
|
|
|
|
case SUBDIV:
|
2010-08-28 23:21:44 +04:00
|
|
|
stream << "(level = " << this->level << ", convexity = " << this->convexity << ")";
|
2010-03-02 21:22:31 +03:00
|
|
|
break;
|
2011-04-12 22:35:44 +04:00
|
|
|
case HULL:
|
|
|
|
stream << "()";
|
|
|
|
break;
|
2010-03-02 21:22:31 +03:00
|
|
|
default:
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
|
|
|
|
return stream.str();
|
|
|
|
}
|