Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

14
  • could you explain why you do not want to use intersections? note that the code there uses fpu in places to avoid problems with pgfmath, so trying to do it with the latter may be problematic. (but I would prefer l3fp to fpu these days.) Commented yesterday
  • @cfr Intersections feels like the wrong approach because it just operates on existing paths, and not on the parametric equations which defined those paths. Commented yesterday
  • BTW, exp(\x) is more efficient than e^\x = ln{e)*\exp{\x} since it doesn't have to compute ln(e)=1. exp uses a polynomial approximaiton (Taylor's series) Commented yesterday
  • 1
    I was more thinking of your preference for doing it with pgfmath. b/c then you would need to do something to reduce the chances of exceeding tex's max dimension and also think about whether it is accurate enough. a lua solution is different: you do not have to think about the limitations of tex arithmetic in that case and starting from the maths makes more sense. I mean, I wouldn't start from that library, but I would not try to use pgfmath ;). Commented yesterday
  • 1
    @cfr That is reasonable, and yes that is something I overlooked initially. Pgfmath is clearly not the tool to do general computational math. The practical approach is to use Lua then. Commented yesterday