- From: Julien Quint <julien@igel.co.jp>
- Date: Mon, 1 Jul 2013 10:24:59 +0900
- To: "David Dailey" <ddailey@zoominternet.net>
- Cc: <public-geometryapi@w3.org>
- Message-Id: <AEF3B1E2-92E9-440D-9D44-092914F3BDE4@igel.co.jp>
On Jun 29, 2013, at 5:06 AM, David Dailey wrote: > Hi Doug, all, Hi Doug, David, et al. Thanks for making this list, I was thinking about this earlier this morning as well so I will add to it if you don’t mind. > Here’s just a quick list of things that come to mind that one might often wish to do > > Intersecting things, as per Kevin Lindsay’s work (wasn’t some of this already in SVG 1.2?): > Lines, circles, ellipses, bezier (c and q) all with one another > Also paths and polylines intersecting with themselves (which gets trickier when you take the width of the stroke into account) > (…) > Given n points > Find a polygon passing through them > Produce a Voronoi diagram And a Delaunay triangulation :) > Produce random > > N-gon > Smooth Bezier curves that pass through N control points and preserve continuous first derivatives > Tessellations (polygonal, or rectangular – think HTML tables with colspan and rowspan) Also regular polygons with N sides inscribed in a circle (with an orientation.) One thing that I would be really interested in variable-width stokes as well. Julien
Received on Monday, 1 July 2013 12:28:57 UTC