1387 search results - page 187 / 278 » Convexity in Discrete Space |
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
COMPGEOM
2001
ACM
14 years 18 days ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
COMPGEOM
2005
ACM
13 years 11 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
DAGSTUHL
2010
13 years 10 months ago
2010
Mesh optimization of 2D and 3D triangulations is used in multiple applications extensively. For example, mesh optimization is crucial in the context of adaptively discretizing geo...
NIPS
2003
13 years 10 months ago
2003
We describe a Markov chain method for sampling from the distribution of the hidden state sequence in a non-linear dynamical system, given a sequence of observations. This method u...