Concept

Star domain

In geometry, a set in the Euclidean space is called a star domain (or star-convex set, star-shaped set or radially convex set) if there exists an such that for all the line segment from to lies in This definition is immediately generalizable to any real, or complex, vector space. Intuitively, if one thinks of as a region surrounded by a wall, is a star domain if one can find a vantage point in from which any point in is within line-of-sight. A similar, but distinct, concept is that of a radial set. Given two points and in a vector space (such as Euclidean space ), the convex hull of is called the and it is denoted by where for every vector A subset of a vector space is said to be if for every the closed interval A set is and is called a if there exists some point such that is star-shaped at A set that is star-shaped at the origin is sometimes called a . Such sets are closed related to Minkowski functionals. Any line or plane in is a star domain. A line or a plane with a single point removed is not a star domain. If is a set in the set obtained by connecting all points in to the origin is a star domain. Any non-empty convex set is a star domain. A set is convex if and only if it is a star domain with respect to any point in that set. A cross-shaped figure is a star domain but is not convex. A star-shaped polygon is a star domain whose boundary is a sequence of connected line segments. The closure of a star domain is a star domain, but the interior of a star domain is not necessarily a star domain. Every star domain is a contractible set, via a straight-line homotopy. In particular, any star domain is a simply connected set. Every star domain, and only a star domain, can be "shrunken into itself"; that is, for every dilation ratio the star domain can be dilated by a ratio such that the dilated star domain is contained in the original star domain. The union and intersection of two star domains is not necessarily a star domain.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.