polygonal

An invisible voxelized-representation of polygonal scene geometry is used there for approximating global illumination of visibly rendered polygonal geometry.

If your input is a polygonal mesh (or higher-dimensional equivalent) then the problem is easy, but what about things like parametric surfaces?

You can create a polygonal fence that describes your preferred color set and calculate an intersection from the hue value in HSV.

If they're polygonal, the polygon will not have perfectly flat faces due to finite precision and may have false convexity.

We never considered polygonal downloads to be that useful, and also adds complexity to the UI.

Not gonna fly realtime any longer (or at all) if you ever wanted to use it with additional polygonal art.

These polygonal regions surround the given points and fill the graph, acting as large unmissable mouseover targets instead of the tiny points.

If my hue is 320, then I could find a nice shade of orange/red along the polygonal fence.

Ready supports 1D, 2D and 3D data, as well as polygonal and polyhedral meshes.

I can imagine a shotgun shell using ceramic pellets (probably with non-spheroid polygonal shapes, for extra damage).

Also just noticed that stuff like bracers that should be rounded (using GL 4 hardware tessellation) is not and has visible polygonal edges.

There's also the question of whether faces should be triangular or polygonal.

Wings is polygonal, but it's a subdivision modeler so it means that all the models are inherently volumetric which makes it appropriate for printing - no possibility of an "open" object.

I mentioned computing convex hulls because I wasn't sure whether your CAD program exports "manifold" meshes, that is, closed polygonal meshes where each edge is connected to exactly two faces.

Garland and Heckbert had a nice algorithm for this sort of thing in their 1995 paper, "Fast Polygonal Approximation of Terrains and Height Fields." The paper is mainly devoted to height fields, obviously, but at the end they demonstrate that their algorithm is also effective at triangulating color images for Gouraud-shading as well.

My Haskell way of thinking of it would be that Square and Rectangle are distinct (non-inheriting) data types, Square and Rectangle are both instances of the type-class Rectangular (which inherits and provides default functions for Closed and Polygonal), Square has a transformation into Rectangle, and Rectangle has a transformation into Maybe Square.