qi-hardware/cae-tools
1
0
Fork 0
mirror of git://projects.qi-hardware.com/cae-tools.git synced 2025-04-21 12:27:27 +03:00
Code Activity

ptrude/: more comments; copyright headers; improved Makefile

Browse Source
This commit is contained in:
Werner Almesberger
2011-07-28 23:20:18 -03:00
parent dcb1c7856a
commit 188cf9d9d4
4 changed files with 117 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
ptrude/path.c
View File

@@ -1,3 +1,15 @@
/*
* path.c - 2D path operations
*
* Written 2011 by Werner Almesberger
* Copyright 2011 by Werner Almesberger
*
* 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.
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
@@ -92,6 +104,13 @@ static const struct vertex *add_vertex(struct path *path, double x, double y,
}
/*
* "corner" replaces a corner with a ploygon if the corner is too sharp to
* be within distance "d" of the bend radius. This may change the point from
* where we resume drawing (originally the corner point, "b"). "corner"
* therefore returns the new end of the arc.
*/
static const struct vertex *corner(struct path *path, const struct vertex *a,
const struct vertex *b, const struct vertex *c, double r, double d)
{
@@ -230,17 +249,29 @@ static const struct vertex *corner(struct path *path, const struct vertex *a,
n = (int) ceil((t2-2*(p+q))/(2*q));
/*
* @@@ We should evenly distribute the slack and try to pick a
* We could evenly distribute the slack and try to pick a
* smaller value for d, but that seems difficult.
*
* A drawback of reducing p would be that we may make the
* corner unnecessarily sharp, possibly even turning against
* the general direction of the turn. We'd still respect the
* bend radius and the tolerance, but the result may look weird
* anyway.
*
* For now, we just center the polygon.
*/
q = (t2/2-p)/(n+1);
if (n)
ang = p+q;
else
else {
ang = t2/2;
/*
* @@@ To do: adjust the radius such that we always hug
* the r-d circle (see arc.fig) and usually not the
* r+d circle. Right now, it's just the opposite.
*/
}
u = tan(p)*(r-d);
v = tan(q)*(r-d);