Search Results for ""

The breaking up of self-intersecting polygons into simple polygons (illustrated above) is also called tessellation (Woo et al. 1999).

The generalization of a Voronoi polygon to n dimensions for n>2.

The boundaries of the cells of a Voronoi diagram.

The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two ...

A simplicial complex is a space with a triangulation. Formally, a simplicial complex K in R^n is a collection of simplices in R^n such that 1. Every face of a simplex of K is ...

There exists a triangulation point Y for which the triangles BYC, CYA, and AYB have equal Brocard angles. This point is a triangle center known as the equi-Brocard center and ...

A convex polyhedron is defined as the set of solutions to a system of linear inequalities mx<=b (i.e., a matrix inequality), where m is a real s×d matrix and b is a real ...

The (not necessarily regular) tetrahedron of least volume circumscribed around a convex body B with volume V is not known. If B is a parallelepiped, then the smallest-volume ...

An unduloid, also called an onduloid, is a surface of revolution with constant nonzero mean curvature. It is a roulette obtained from the path described by the foci of a ...

A Cevian point P is point with respect to which a set of Cevians of a triangle are taken. Connecting the endpoints of the Cevians through a point P gives the so-called Cevian ...