At the International Workshop on Combinatorial Image Analysis, held in Brno, Czech Republic, our URGE To Compute team received the Best Student Paper Award for their presentation, "On Intersection ...

Department of Computer Science, University of North Carolina, Sitterson Hall, Chapel Hill, NC 27599-3175, USA Supported in part by an NSERC Research Grant, the Killam Foundation, and the CIES. This ...

Abstract: This article proposes a prescribed-time distributed convex polygon entrapping control protocol based on relative measurements for leader-follower-constructed autonomous aerial vehicles (AAVs ...

These points are called ‘conical singularities’, and we say they have an ‘angle deficit’ of 60°. Thurston showed you can get any such sphere by drawing an 11-sided convex polygon in a lattice of ...

Complex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.

Every polygon falls into four semi-interchangeable categories. Closed shapes with more than three sides and angles can either be convex, concave, regular or irregular polygons. A regular (or ...

When we allow irregular polygons, things get more interesting. Surprisingly, every triangle can tile the plane, and even more surprisingly, so can every quadrilateral. On the other hand, it’s ...

Charlie Hall is Polygon’s tabletop editor ... with some cards concave and others convex. As a result, they required a lengthy breaking-in period before they would lay flat on the table.

A patchwork of polygon-shaped cracks in ancient Martian mud are evidence of past wet-dry cycles, which could have helped extraterrestrial life emerge on the Red Planet. When you purchase through ...