Results 1  10
of
276,265
in the University of Hull by
, 2004
"... The current standard method for gathering and representation of archaeological information consists of twodimensional layer managers. This thesis presents an archaeological Geographical Information System (GIS) based on an immersive virtual environment. The aim is to allow the integration of many ..."
Abstract
 Add to MetaCart
The current standard method for gathering and representation of archaeological information consists of twodimensional layer managers. This thesis presents an archaeological Geographical Information System (GIS) based on an immersive virtual environment. The aim is to allow the integration
Shape Formation by SelfDisassembly in Programmable Matter Systems
, 2012
"... Programmable matter systems are composed of small, intelligent modules able to form a variety of macroscale objects with specific material properties in response to external commands or stimuli. While many programmable matter systems have been proposed in fiction, (Barbapapa, Changelings from Star T ..."
Abstract
 Add to MetaCart
Programmable matter systems are composed of small, intelligent modules able to form a variety of macroscale objects with specific material properties in response to external commands or stimuli. While many programmable matter systems have been proposed in fiction, (Barbapapa, Changelings from Star
Convex hulls of Coxeter groups
 PROCEEDINGS OF THE INTERNATIONAL CONFERENCE IN HONOUR OF JAAK PEETRE ON HIS 65TH BIRTHDAY
, 2002
"... We survey known and new results concerning the geometric structure of the convex hulls of finite irreducible Coxeter groups. In particular we consider a conjecture concerning the normals to the faces of maximal dimension of these convex hulls. This conjecture is related to a theorem of Birkhoff and ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We survey known and new results concerning the geometric structure of the convex hulls of finite irreducible Coxeter groups. In particular we consider a conjecture concerning the normals to the faces of maximal dimension of these convex hulls. This conjecture is related to a theorem of Birkhoff
Convex hulls; Bivariate density;
"... Convex hull drawing is a wellknown computational geometry problem and there is a multitude of algorithms available for solving it. Even though links between computational geometry and statistics have ..."
Abstract
 Add to MetaCart
Convex hull drawing is a wellknown computational geometry problem and there is a multitude of algorithms available for solving it. Even though links between computational geometry and statistics have
Computing Convex Hulls Using Smart Pixels
"... We consider a problem domain consisting of a quadratic grid of n “smart pixels ” which observe a blackandwhite image. Each of these smart pixels can communicate with its direct neighbors and perform simple computations. Contiguous groups of black pixels form objects on the grid. We present a de ..."
Abstract
 Add to MetaCart
deterministic algorithm to compute the convex hulls of all objects on the pixel grid simultaneously in time O( n). 1
Convex Hulls (chull)
, 1996
"... We define and implement the data type chull. It maintains convex hulls in arbitrary dimensions and supports insertions of points and membership queries. The interior of the hull and the boundary of the hull are simplicial complexes. Both complexes can be traversed. An original version of this report ..."
Abstract
 Add to MetaCart
We define and implement the data type chull. It maintains convex hulls in arbitrary dimensions and supports insertions of points and membership queries. The interior of the hull and the boundary of the hull are simplicial complexes. Both complexes can be traversed. An original version
Chapter 3 Convex Hull
"... There exists an incredible variety of point sets and polygons. Among them, some have certain properties that make them “nicer ” than others in some respect. For instance, look at the two polygons shown below. (a) A convex polygon. (b) A nonconvex polygon. Figure 3.1: Examples of polygons: Which do ..."
Abstract
 Add to MetaCart
: Does such a set H (always) exist? Fortunately, we are on the safe side because the whole space Rd is certainly convex. It is less obvious, but we will see below that H is actually unique. Therefore it is legitimate to refer to H as the smallest convex set enclosing P or—shortly—the convex hull of P.
Chapter 3 Convex Hull
"... There exists an incredible variety of point sets and polygons. Among them, some have certain properties that make them “nicer ” than others in some respect. For instance, look at the two polygons shown below. (a) A convex polygon. (b) A nonconvex polygon. Figure 3.1: Examples of polygons: Which do ..."
Abstract
 Add to MetaCart
There exists an incredible variety of point sets and polygons. Among them, some have certain properties that make them “nicer ” than others in some respect. For instance, look at the two polygons shown below. (a) A convex polygon. (b) A nonconvex polygon. Figure 3.1: Examples of polygons: Which do
Results 1  10
of
276,265