Search Results for ""

An abstract machine that is implemented in software is termed a virtual machine.

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...

A set of identities involving n-dimensional visible lattice points was discovered by Campbell (1994). Examples include product_((a,b)=1; ...

Let f_n(z) be a sequence of functions, each regular in a region D, let |f_n(z)|<=M for every n and z in D, and let f_n(z) tend to a limit as n->infty at a set of points ...

As defined by Gray (1997, p. 201), Viviani's curve, sometimes also called Viviani's window, is the space curve giving the intersection of the cylinder of radius a and center ...

For a point P inside an equilateral triangle DeltaABC, the sum of the perpendiculars p_i from P to the sides of the triangle is equal to the altitude h. This result is simply ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

A conjecture which treats the heights of points relative to a canonical class of a curve defined over the integers.